Virtualizing for User-Defined Algorithm Electronic Trading

ABSTRACT

Certain embodiments reduce the risks of traditionally programmed algorithms such as syntax errors, unclear logic, and the need for a non-trader programmer to develop the algorithm as specified by a trader by reducing or eliminating the writing of programming code by a user. Certain embodiments provide a design canvas area and blocks for designing an algorithm. Certain embodiments provide for grouping blocks placed in the design canvas area. Certain embodiments provide for virtualized group blocks enabling dynamic instantiation of portions of an algorithm to handle particular discrete events. Certain embodiments provide for operation of some or all portions of an algorithm when a connection between a client device and an algorithm server is broken.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.15/458,504 filed Mar. 14, 2017, which is a continuation of U.S. patentapplication Ser. No. 12/905,726 filed Oct. 15, 2010, now U.S. Pat. No.9,652,803, which claims the benefit of U.S. Provisional Application No.61/253,315, entitled “Trading Application with Futures Ranking and OrderTool, Price Level Indicator Tool, and Market Change Audio IndicatorTool”, filed Oct. 20, 2009; U.S. Provisional Application No. 61/253,324,entitled “System and Method for Building User-Defined Algorithms forElectronic Trading Exchange”, filed Oct. 20, 2009; U.S. ProvisionalApplication No. 61/263,300, entitled “System and Method for BuildingUser-Defined Algorithms for Electronic Trading Exchange”, filed Nov. 20,2009; U.S. Provisional Application No. 61/312,003, entitled “System andMethod for Launching Automated Trading Applications”, filed Mar. 9,2010; U.S. Provisional Application No. 61/318,685, entitled “System andMethod for Virtualizing User-Defined Algorithms for Electronic TradingExchange”, filed Mar. 29, 2010; U.S. Provisional Application No.61/320,061, entitled “System and Method for Automating Feedback-BasedUser-Defined Algorithms for Electronic Trading Exchange”, filed Apr. 1,2010; and U.S. Provisional Application No. 61/393,313, entitled“User-Defined Algorithm Electronic Trading”, filed Oct. 14, 2010. Eachof these applications is herein incorporated by reference in itsentirety for all purposes.

BACKGROUND

The presently described technology is directed towards electronictrading systems. More particularly, certain embodiments are directedtowards user-defined algorithm electronic trading.

An electronic trading system generally includes a client device incommunication with an electronic exchange that may serve as a host forthe client device. Typically, the electronic trading system provides forelectronically matching orders to buy and sell tradeable objects to betraded. A tradeable object is an item that may be traded. Stocks,options, futures contracts, securities, and commodities are a fewexamples of tradeable objects.

The electronic exchange transmits market data to the client device. Themarket data may include, for example, price data, market depth data,last traded quantity data, data related to a market for the tradeableobject, and/or combinations thereof. The client device receives marketdata from the electronic exchange.

In some electronic trading systems, a client device receives andprocesses market data without displaying the market data on a displaydevice. For example, a “black-box” algorithmic trading system may runautomatically and without displaying market data. However, in otherelectronic trading systems, the client device displays processed marketdata on a display device. The client device may include software thatcreates a trading screen. In general, a trading screen enables a user toparticipate in an electronic trading session. For example, a tradingscreen may enable a user to view market data, submit a trade order tothe electronic exchange, obtain a market quote, monitor a position,and/or combinations thereof.

In some electronic trading systems, the client device sends trade ordersto the electronic exchange. However, in other electronic tradingsystems, other devices, such as server side devices, are responsible forsending the one or more trade orders to the electronic exchange. Uponreceiving a trade order, the electronic exchange enters the trade orderinto an exchange order book and attempts to match quantity of the tradeorder with quantity of one or more contra-side trade orders. By way ofexample, a sell order is contra-side to a buy order with the same price.Similarly, a buy order is contra-side to a sell order with the sameprice. Unmatched quantity of a trade order is held in the exchange orderbook until quantity of a trade order is matched by the electronicexchange. Unmatched quantity of a trade order may also be removed fromthe order book when a trade order is cancelled, either by the clientdevice or electronic exchange. Upon matching quantity of the tradeorder, the electronic exchange may send a confirmation to the clientdevice that the quantity of the trade order was matched.

Electronic exchanges have made it possible for an increasing number ofparticipants to be active in a market at any given time. The increase inthe number of potential market participants has advantageously led to,among other things, a more competitive market and greater liquidity. Ina competitive environment, like electronic trading, where every secondor a fraction of second counts in intercepting trading opportunities, itis desirable to offer tools that help a participant effectively competein the marketplace or even give an edge over others.

Some current systems include algorithmic trading systems which may allowfor quicker evaluation and reaction to changes in market information.However, such systems typically require skilled programmers to developthe trading algorithms, take days (or even months) to test and debug,and the development and debugging process must be repeated when a traderdecides on a different approach or desires a modification to thealgorithm's logic.

SUMMARY

The embodiments described herein include, but are not limited to,various devices, systems, methods, and computer program products.

Certain embodiments provide building block buttons and an algorithm areato define an algorithm. Certain embodiments allow for adjusting both theparameters and the logic of an algorithm rapidly, even during a singletrading session. Certain embodiments provide live evaluation of anexpression as the algorithm is being defined. Certain embodiments reducethe risks of traditionally programmed algorithms such as syntax errors,unclear logic, and the need for a non-trader programmer to develop thealgorithm as specified by a trader by reducing or eliminating thewriting of programming code by a user. Certain embodiments provide asingle application for building, debugging, and simulating (with realmarket data) an algorithm all at the same time. In addition, the singleapplication may also provide for initiating the placement of ordersusing the algorithm.

Certain embodiments provide a design canvas area and blocks fordesigning an algorithm. Certain embodiments provide blocks with complexfunctionality for use in an algorithm. Certain embodiments provide forgrouping blocks placed in the design canvas area. Certain embodimentsprovide for virtualized group blocks enabling dynamic instantiation ofportions of an algorithm to handle particular discrete events. Certainembodiments allow for adjusting both the parameters and the logic of analgorithm rapidly, even during a single trading session. Certainembodiments provide live feedback for blocks as the algorithm is beingdesigned. Certain embodiments provide safety features to reducepotential errors when an algorithm is designed. Certain embodimentsprovide for operation of some or all portions of an algorithm when aconnection between a client device and an algorithm server is broken.Certain embodiments reduce the risks of traditionally programmedalgorithms such as syntax errors, unclear logic, and the need for anon-trader programmer to develop the algorithm as specified by a traderby reducing or eliminating the writing of programming code by a user.Certain embodiments provide a single application for building,debugging, and simulating (with real market data) an algorithm all atthe same time. In addition, the single application may also provide forinitiating the placement of orders using the algorithm.

Certain embodiments provide for initiating placement of an order to bemanaged by an algorithm selected as an order type. Certain embodimentsprovide for initiating placement of an order to be managed by a selecteduser-defined trading algorithm from a value axis. Certain embodimentsprovide for changing a variable for an algorithm while the algorithm ismanaging an order. Certain embodiments provide for manually modifying anorder being managed by an algorithm. Certain embodiments provide forassigning to an unmanaged order an algorithm to manage the order.Certain embodiments provide for displaying working orders being managedby different user-defined trading algorithms on a value axis.

Certain embodiments provide a ranking tool. Certain embodiments providefor display of a ranking of selected tradeable objects to be used fororder placement. Certain embodiments provide for selecting an executionstrategy for initiating order(s) based on the ranking.

Other embodiments are described below. In addition, modifications may bemade to the described embodiments without departing from the spirit orscope of the inventions.

BRIEF DESCRIPTION OF THE DRAWINGS

Example embodiments are described herein with reference to the followingdrawings.

FIG. 1 illustrates a block diagram of an electronic trading system inwhich certain embodiments may be employed.

FIG. 2A illustrates a trading interface according to certainembodiments.

FIG. 2B illustrates an instrument selection interface according tocertain embodiments.

FIGS. 2C-2I illustrate building a definition for an algorithm in atrading interface according to certain embodiments.

FIG. 2J illustrates a trading interface according to certainembodiments.

FIG. 3A illustrates a block diagram of an electronic trading system inwhich certain embodiments may be employed.

FIG. 3B illustrates a trading interface according to certainembodiments.

FIG. 3C illustrates examples of blocks that may be used in the tradinginterface according to certain embodiments.

FIGS. 3D-1 through 3D-7 illustrate example programming code generatedaccording to certain embodiments.

FIGS. 3E-R illustrate trading interfaces according to certainembodiments.

FIGS. 4A-4F illustrate trading interfaces according to certainembodiments.

FIG. 5 illustrates a ranking tool according to certain embodiments.

FIG. 6 illustrates a block diagram of a computing device according tocertain embodiments.

The foregoing summary, as well as the following detailed description,will be better understood when read in conjunction with the drawingswhich show certain embodiments. The drawings are for the purpose ofillustrating certain embodiments, but it should be understood that thepresent inventions are not limited to the arrangements andinstrumentality shown in the drawings.

DETAILED DESCRIPTION I. Example Electronic Trading System

FIG. 1 illustrates a block diagram of an electronic trading system 100in which certain embodiments may be employed. The system 100 includes aclient device 110, a gateway 120, and an electronic exchange 130. Theclient device 110 is in communication with the gateway 120. The gateway120 is in communication with the exchange 130.

As used herein, the phrase “in communication with” may include in directcommunication and indirect communication through one or moreintermediary components.

In operation, the client device 110 may send orders to buy or selltradeable objects at the exchange 130. For example, a user may utilizethe client device 110 to send the orders. The orders are sent throughthe gateway 120 to the exchange 130. In addition, market data is sentfrom the exchange 130 through the gateway 120 to the client device 110.The user may also utilize the client device 110 to monitor this marketdata and base a decision to send an order for a tradeable object on themarket data.

A tradeable object is anything which can be traded with a quantityand/or a price. For example, financial products such as stocks, options,bonds, futures, currency, warrants, funds derivatives, securities,commodities, traded events, goods, and collections and/or combinationsof these may be tradeable objects. A tradeable object may be “real” or“synthetic.” A real tradeable object includes products that are listedby an exchange. A synthetic tradeable object includes products that aredefined by the user and are not listed by an exchange. For example, asynthetic tradeable object may include a combination of real (or othersynthetic) products such as a synthetic spread created by a traderutilizing a client device 110.

The client device 110 may include one or more electronic computingplatforms such as a hand-held device, laptop, desktop computer,workstation with a single or multi-core processor, server with multipleprocessors, and/or cluster of computers, for example. For example, whilelogically represented as a single device, client device 110 may includea trading terminal in communication with a server, where collectivelythe trading terminal and the server are the client device 110. Thetrading terminal may provide a trading screen to a user and maycommunicate commands to the server for further processing of the user'sinputs through the trading screen, such as placing orders.

The client device 110 is generally owned, operated, controlled,programmed by, configured by, or otherwise used by a user. As usedherein, the phrase “user” may include, but is not limited to, a human(for example, a trader) or an electronic trading device (for example,including a processor and memory or an algorithmic trading system). Oneor more users may be involved in the ownership, operation, control,programming, configuration, or other use, for example.

The client device 110 may include one or more trading applications. Thetrading application(s) may, for example, process market data byarranging and displaying the market data in trading and chartingwindows. The market data may be received from exchange 130, for example.As another example, the market data may be received from a simulationenvironment that provides historical data and/or simulates an exchangebut does not effectuate real-world trades. This processing may be basedon user preferences, for example. The trading application(s) may includean automated trading tool such as an automated spread trading tool, forexample. The one or more trading applications may be distributed acrossone or more of the computing devices of the client device 110. Forexample, certain components of a trading application may be executed ona trading workstation and other components of the trading applicationmay be executed on a server in communication with the workstation.

The client device 110 may include an electronic trading workstation, aportable trading device, an algorithmic trading system such as a “blackbox” or “grey box” system, an embedded trading system, and/or anautomated trading tool, for example. For example, the client device 110may be a computing system running a copy of X_TRADER®, an electronictrading platform provided by Trading Technologies International, Inc. ofChicago, Ill. As another example, the client device 110 may be acomputing device running an automated trading tool such as Autospreader®and/or Autotrader™, also provided by Trading Technologies International,Inc.

Trading applications may be stored in a computer readable medium of theclient device 110. In certain embodiments, certain components of atrading application may be stored on a trading workstation and othercomponents of the trading application may be stored on a server incommunication with the workstation. In certain embodiments, one or morecomponents of a trading application may be loaded into the computerreadable medium of the client device 110 from another computer readablemedium. For example, the trading application (or updates to the tradingapplication) may be stored by a manufacturer, developer, or publisher onone or more CDs or DVDs, which are then provided to someone responsiblefor loading the application onto the client device 110 or to a serverfrom which the client device 110 retrieves the trading application. Asanother example, the client device 110 may receive the tradingapplication (or updates to the trading application) from a server, forexample, via the Internet or an internal network. The client device 110may receive the trading application or updates when requested by theclient device 110 (“pull distribution”) and/or un-requested by theclient device 110 (“push distribution”).

The client device 110 is adapted to send orders to buy or sell atradeable object. The client device 110 may also be adapted to cancelorders, change orders, and/or query an exchange, for example. As anotherexample, the client device 110 may be adapted to send orders to asimulated exchange in a simulation environment that does not effectuatereal-world trades.

The orders sent by the client device 110 may be sent at the request of auser or automatically, for example. For example, a trader may utilize anelectronic trading workstation to place an order for a particulartradeable object, manually providing various parameters for the ordersuch as an order price and/or quantity. As another example, an automatedtrading tool may calculate one or more parameters for an order andautomatically send the order. In some instances, an automated tradingtool may prepare the order to be sent but not actually send it withoutconfirmation from the user.

In certain embodiments, the client device 110 includes a user interface.The user interface may include one or more display devices forpresenting a text-based or graphical interface of a trading applicationto a user, for example. For example, the display devices may includecomputer monitors, hand-held device displays, projectors, and/ortelevisions. The user interface may be used by the user to specify orreview parameters for an order using a trading application. The userinterface may include one or more input devices for receiving input froma user, for example. For example, the input devices may include akeyboard, trackball, two or three-button mouse, and/or touch screen. Theuser interface may include other devices for interacting with a user.For example, information may be aurally provided to a user through aspeaker and/or received through a microphone.

In certain embodiments, a trading application may include one or moretrading screens to enable a trader to interact with one or more markets.Trading screens may enable traders to obtain and view marketinformation, set order entry parameters, enter and cancel orders, and/ormonitor positions while implementing various trading strategies, forexample. For example, a trading application may receive information(such as bid prices, bid quantities, ask prices, ask quantities, pricesand quantities for past sales, and/or other market related information)from exchange 130 which, in turn, may be displayed with a user interfaceof client device 110. Based on the received information, the tradingscreen may display a range of price levels and corresponding bid and askquantities for the price levels in regard to tradeable objects. In orderto provide the trader with pertinent trading information, the tradingscreen may display a range of prices (and the corresponding bid and askquantities) around the inside market. The information may becontinuously or regularly provided to the trading application, whichallows the trading application to update the trading screen with currentmarket information. A trader may use the trading screen to place buy andsell orders for tradeable objects or to otherwise trade the tradeableobjects based on the displayed information, for example.

Trading screens may display one or more trading tools. Trading tools areelectronic tools that allow, assist with, and/or facilitate electronictrading. Exemplary trading tools include, but are not be limited to,charts, trading ladders, order entry tools, automated trading tools,automated spreading tools, risk management tools, order parameter tools,order entry systems, market grids, fill windows, and market orderwindows, combinations thereof, other electronic tools used for trading,preparing to trade, or managing trades.

In certain embodiments, the client device 110 includes an algorithmictrading application. For example, the client device 110 may include ablack box or grey box trading application. As another example, theclient device 110 may include a trading application whichalgorithmically processes market data but provides a user interface toallow a user to manually place orders based on the algorithmicprocessing or to manipulate orders that were placed automatically. Analgorithmic trading application is a trading application which includesan automatically processed algorithm to perform certain actions. Thatis, the trading application includes an automated series of instructionsto perform defined action(s). The actions may include processing marketdata in a particular way, placing an order, modifying an existing order,deleting an order, refraining from placing an order, selecting whichtradeable object(s) to act on, determining a price to place or modify anorder at, determining a quantity to place an order at or modify an orderto be, determining whether an order should be to buy or sell, anddelaying action for a period of time, for example.

As used herein, an algorithm (also referred to as a trading algorithm)is specified by a definition which includes logic expressions andparameters that describe the algorithm to be used in trading. Logicexpressions specify the relationship between parameters and may generatemore parameters. Parameters may include, for example, inputs into thelogic expressions of the algorithm. The definition of an algorithm maybe, at least in part, specified by the algorithmic trading application.For example, an algorithmic trading application may allow a user to onlyspecify parameters to be used by pre-defined logic expressions. Asanother example, an algorithmic trading application may allow a user tospecify some or all of the logic expressions and some or all of theparameters. A trading algorithm where the logic expressions arespecified by a user is a user-defined trading algorithm.

In certain embodiments, the orders from the client device 110 are sentto the exchange 130 through the gateway 120. The client device 110 maycommunicate with the gateway 120 using a local area network, a wide areanetwork, a virtual private network, a T1 line, a T3 line, an ISDN line,a point-of-presence, and/or the Internet, for example.

The gateway 120 is adapted to communicate with the client device 110 andthe exchange 130. The gateway 120 facilitates communication between theclient device 110 and the exchange 130. For example, the gateway 120 mayreceive orders from the client device 110 and transmit the orders to theexchange 130. As another example, the gateway 120 may receive marketdata from the exchange 130 and transmit the market data to the clientdevice 110.

In certain embodiments, the gateway 120 performs processing on datacommunicated between the client device 110 and the exchange 130. Forexample, the gateway 120 may process an order received from the clientdevice 110 into a data format acceptable by the exchange 130. Similarly,the gateway 120 may transform market data in an exchange-specific formatreceived from the exchange 130 into a format understood by the clientdevice 110. The processing of the gateway 120 may also include trackingorders from the client device 110 and updating the status of the orderbased on fill confirmations received from the exchange 130, for example.As another example, the gateway 120 may coalesce market data from theexchange 130 and provide it to the client device 120.

In certain embodiments, the gateway 120 provides services other thanprocessing data communicated between the client device 110 and theexchange 130. For example, the gateway 120 may provide risk processing.

The gateway 120 may include one or more electronic computing platformssuch as a hand-held device, laptop, desktop computer, workstation with asingle or multi-core processor, server with multiple processors, and/orcluster of computers, for example.

The gateway 120 may include one or more gateway applications. Thegateway application(s) may, for example, handle order processing andmarket data processing. This processing may be based on userpreferences, for example.

In certain embodiments, the gateway 120 communicates with the exchange130 using a local area network, a wide area network, a virtual privatenetwork, a T1 line, a T3 line, an ISDN line, a point-of-presence, and/orthe Internet, for example.

In general, the exchange 130 may be owned, operated, controlled, or usedby an exchange entity. Exemplary exchange entities include the CMEGroup, the London International Financial Futures and Options Exchange(“LIFFE”), the IntercontinentalExchange (“ICE”), and Eurex. The exchange130 may be an electronic matching system, such as a computer, server, orother computing device, that is adapted to allow tradeable objects, forexample, offered for trading by the exchange, to be bought and sold.

The exchange 130 is adapted to match orders to buy and sell tradeableobjects. The tradeable objects may be listed for trading by the exchange130. The orders may include orders received from the client device 110,for example. Orders may be received from the client device 110 throughthe gateway 120, for example. In addition, the orders may be receivedfrom other devices in communication with the exchange 130. That is,typically the exchange 130 will be in communication with a variety ofother client devices (which may be similar to client device 110) thatalso provide orders to be matched.

The exchange 130 is adapted to provide market data. The market data maybe provided to the client device 110, for example. The market data maybe provided to the client device 110 through the gateway 120, forexample. The market data may include data that represents the insidemarket, for example. The inside market is the lowest sell price (alsoreferred to as the “best ask”) and the highest buy price (also referredto as the “best bid”) at a particular point in time. The market data mayalso include market depth. Market depth refers to the quantitiesavailable at the inside market and may also refer to quantitiesavailable at other prices away from the inside market. Thus, the insidemarket may be considered the first level of market depth. One tick awayfrom the inside market may be considered the second level of marketdepth, for example. In certain embodiments, market depth is provided forall price levels. In certain embodiments, market depth is provided forless than all price levels. For example, market depth may be providedonly for the first five price levels on either side of the insidemarket. The market data may also include information such as the lasttraded price (LTP), the last traded quantity (LTQ), and order fillinformation.

In certain embodiments, the system 100 includes more than one clientdevice 110. For example, multiple client devices similar to the clientdevice 110, discussed above, may be in communication with the gateway120 to send orders to the exchange 130.

In certain embodiments, the system 100 includes more than one gateway120. For example, multiple gateways similar to the gateway 120,discussed above, may be in communication with the client device 110 andthe exchange 130. Such an arrangement may be used to provide redundancyshould one gateway 120 fail, for example.

In certain embodiments, the system 100 includes more than one exchange130. For example, the gateway 120 may be in communication with multipleexchanges similar to the exchange 130, discussed above. Such anarrangement may allow the client device 110 to trade at more than oneexchange through the gateway 120, for example.

In certain embodiments, the system 100 includes more than one exchange130 and more than one gateway 120. For example, multiple gatewayssimilar to the gateway 120, discussed above, may be in communicationwith multiple exchanges similar to the exchange 130, discussed above.Each gateway may be in communication with one or more differentexchanges, for example. Such an arrangement may allow one or more clientdevices 110 to trade at more than one exchange (and/or provide redundantconnections to multiple exchanges), for example.

In certain embodiments, the client device 110 includes one or morecomputing devices or processing components. In other words, thefunctionality of the client device 110 may be performed by more than onecomputing device. For example, one computing device may generate ordersto be sent to the exchange 130 while another computing device mayprovide a graphical user interface to a trader. In certain embodiments,the gateway 120 includes one or more computing devices or processingcomponents. In other words, the functionality of the gateway 120 may beperformed by more than one computing device. In certain embodiments, theexchange 130 includes one or more computing devices or processingcomponents. In other words, the functionality of the exchange 130 may beperformed by more than one computing device.

In certain embodiments, the gateway 120 is part of the client device110. For example, the components of the gateway 120 may be part of thesame computing platform as the client device 110. As another example,the functionality of the gateway 120 may be performed by components ofthe client device 110. In certain embodiments, the gateway 120 is notpresent. Such an arrangement may occur when the client device 110 doesnot need to utilize the gateway 120 to communicate with the exchange130, for example. For example, if the client device 110 has been adaptedto communicate directly with the exchange 130.

In certain embodiments, the gateway 120 is physically located at thesame site as the client device 110. In certain embodiments, the gateway120 is physically located at the same site as the exchange 130. Incertain embodiments, the client device 110 is physically located at thesame site as the exchange 130. In certain embodiments, the gateway 120is physically located at a site separate from both the client device 110and the exchange 130.

While not shown for the sake of clarity, in certain embodiments, thesystem 100 may include other devices that are specific to thecommunications architecture such as middleware, firewalls, hubs,switches, routers, exchange-specific communication equipment, modems,security managers, and/or encryption/decryption devices.

The components, elements, and/or functionality of the system 100discussed above may be implemented alone or in combination in variousforms in hardware, firmware, and/or as a set of instructions insoftware, for example. Certain embodiments may be provided as a set ofinstructions residing on a computer-readable medium, such as a memory,hard disk, CD-ROM, DVD, EPROM, and/or file server, for execution on ageneral purpose computer or other processing device.

II. Algorithmic Order Builder

Certain embodiments provide building block buttons and an algorithm areato define an algorithm. Certain embodiments allow for adjusting both theparameters and the logic of an algorithm rapidly, even during a singletrading session. Certain embodiments provide live evaluation of anexpression as the algorithm is being defined. Certain embodiments reducethe risks of traditionally programmed algorithms such as syntax errors,unclear logic, and the need for a non-trader programmer to develop thealgorithm as specified by a trader by reducing or eliminating thewriting of programming code by a user. Certain embodiments provide asingle application for building, debugging, and simulating (with realmarket data) an algorithm all at the same time. In addition, the singleapplication may also provide for initiating the placement of ordersusing the algorithm.

FIG. 2A illustrates a trading interface 200 according to certainembodiments. The trading interface 200 is a trading interface for analgorithmic trading application referred to as the Algorithmic OrderBuilder (“AOB”). The AOB allows a trader to create an algorithm for anorder to be placed. However, it should be understood that elements ofthe illustrated trading interface 200 may be incorporated into othertrading interfaces.

The trading interface 200 includes an instrument selection button 201, amarket grid 202, a simulated indicative order entry area 203, an autohedge option 204, a scratch quantity 205, a variable area 206, analgorithm area 210, and building block buttons 215. The algorithm area210 includes a price area 211, a quantity area 212, and a conditionalarea 213.

In operation, an algorithm is defined in the algorithm area 210 byutilizing one or more building block buttons 215 to build an expressionin the price area 211, the quantity area 212, and/or the conditionalarea 213. Default values for user-defined variables in the algorithm maybe specified using the variable area 206. Once the algorithm has beendefined the simulated indicative order entry area 203 may be used toindicate how the logic of the expression will behave. An order to bemanaged according to the defined algorithm may then be initiated using atrading interface.

The instrument selection button 201 provides for selection of aninstrument (that is, a tradeable object) to which an order to be placedrelates. As illustrated in FIG. 2A, the instrument selection button 201has already been used to select the GEH1-GEM1 calendar spread, asindicated by the name of the selected instrument being displayed in theinstrument selection button 201. If an instrument has not yet beenselected, the instrument selection button 201 may display “SelectInstrument” or provide some other indication that an instrument has notyet been selected.

Upon activation of the instrument selection button 201 (for example byselecting it with a pointer or touching it on a touch screen), aninstrument selection interface may be displayed to allow for selectionof the instrument.

FIG. 2B illustrates an instrument selection interface 220 according tocertain embodiments. The instrument selection interface 220 displays alist of tradeable products and allows a user to specify a particulartradeable object to be traded by following an instrument tree. Theinstrument tree allows the user to pick the instrument, instrument type(for example, spreads or futures), and the particular contract to beindicated, for example. For example, as illustrated the GEH1-GEM1calendar spread has been selected.

Referring back to FIG. 2A, the market grid 202 displays marketinformation for a tradeable object. The tradeable objet may be theinstrument selected with the instrument selection button 201, forexample. As another example, the tradeable object may be anothertradeable object selected by a user. The market grid 202 may display bidand/or ask price, bid and/or ask quantity, last traded price and/orquantity information for the tradeable object, for example. For example,the market grid 202 may display the inside market prices and quantitiesfor the selected instrument.

The simulated indicative order entry area 203 provides for generatingfeedback for evaluating operational aspects of an algorithm defined inthe algorithm area 210. A user may simulate placement of a hypotheticalorder to buy or sell the selected instrument with the simulatedindicative order entry area 203 to indicate how the logic of theexpression will behave. A price and/or quantity for the hypotheticalorder may also be specified with the simulated indicative order entryarea 203. Additionally, in certain embodiments, the simulated indicativeorder entry area 203 may be configured (for example, by selecting acheckbox) to initiate placement of an actual order to buy or sell theselected instrument, where the order is managed according to the definedalgorithm.

The auto hedge option 204 provides for specifying that a counter ordershould be placed when an initiated order is filled. The counter order isan order to sell when the filled order was an order to buy and thecounter order is an order to buy when the filled order was an order tosell. The quantity of the counter order may be the same as the filledquantity, for example. The counter order is initially placed at aprofitable exit price, such as one tradeable increment (as defined bythe exchange) from the price of the filled order, for example. Forexample, if the filled order bought a quantity of 10 at a price of 100,the counter order may be to sell a quantity of 10 at a price of 101. Asanother example, if the filled order sold a quantity of 5 at a price of100, the counter order may be to buy a quantity of 5 at a price of 99.

The scratch quantity 205 is used with the auto hedge option 204. Whenthe quantity in the market at the price level of the counter order dropsbelow the specified scratch quantity 205, then the price level of thecounter order is changed to be the price of the corresponding filledorder. In this case, the filled order is said to be “scratched” andthere is no profit on the trade. In certain embodiments, the counterorder may be placed at a price to close the position regardless of theprofit or loss.

The variable area 206 provides for specifying and modifying user-definedvariables used in the algorithm area 210. The variable area 206 displayseach variable name and its value. The variable area may be selected tochange a variable name and/or its value. Variables may also be referredto as parameters of the algorithm.

The algorithm area 210 provides for defining an algorithm to manage anorder. The algorithm area 210 includes the price area 211, the quantityarea 212, and the conditional area 213. Each area corresponds to adifferent aspect of the algorithm.

The building block buttons 215 are used to build expressions in thealgorithm area 210 to define the algorithm. The expressions areevaluated to determine a value for each area of the algorithm area 210.An expression includes one or more elements specified with the buildingblock buttons 215. The use of the building block buttons 215 isdiscussed in more detail below.

Once the algorithm has been defined in the algorithm area 210, an orderto buy or sell may then be initiated with a trading interface. Forexample, in addition to providing for initiating a hypothetical order,in certain embodiments, the simulated indicative order entry area 203may also provide for initiating a real order. As another example,trading interfaces similar to those discussed below may be used toinitiate an order. The initiated order is then managed according to thedefined algorithm.

The price area 211 is evaluated to determine the price at which theorder being managed should be placed. The price area 211 evaluates to anumber representing the price. If the price area 211 is blank, then theprice specified in the simulated indicative order entry area 203 isused. If the price area 211 includes an expression, a price specified inthe simulated indicative order entry area 203 may be ignored. The pricearea 211 may evaluate to a different value at different times, such aswhen market data changes. If so, the order being managed is changed towork at the new price. This may be achieved by deleting the order andplacing a new order at the new price or by using a cancel/replacecommand, for example.

The quantity area 212 is evaluated to determine the quantity for whichthe order being managed should be placed. The quantity area 212evaluates to a number representing the quantity. If the quantity area212 is blank, then the quantity specified in the simulated indicativeorder entry area 203 is used. If the quantity area 212 includes anexpression, a quantity specified in the simulated indicative order entryarea 203 may be ignored. The quantity area 212 may evaluate to adifferent value at different times, such as when market data changes. Ifso, the order being managed is changed to work at the new quantity. Thismay be achieved by deleting the order and placing a new order with thenew quantity or by using a change order quantity command, for example.If the quantity area 212 evaluates to 0, the order being managed may beremoved from the market until the quantity area 212 evaluates to anon-zero value. This may be similar to the conditional area 213evaluating to “false,” as discussed below.

In certain embodiments, the algorithm area 210 does not include thequantity area 212. Instead, the quantity may be fixed or predefined. Forexample, a trading interface for managing hedge orders (for example,orders that are automatically placed when another order for a tradeableobject of a trading strategy is filled; this may also be referred to asa hedge manager interface) may use a quantity that is based on thefilled quantity of the other order and thus is predetermined from theperspective of the algorithm. Thus, an algorithm area in such a tradinginterface, which may allow an algorithm to be used for working hedgeorders, may not include a quantity area 212 because the quantity valuedoes not need to be specified since it is predetermined at the time thealgorithm is utilized.

The conditional area 213 is evaluated to determine whether the algorithmshould be active. The conditional area 213 evaluates to a Boolean value.When the conditional area 213 evaluates to “true,” the algorithm isactive. When the conditional area 213 evaluates to “false,” thealgorithm is inactive. If the conditional area 213 is blank, thealgorithm is always active. The conditional area 213 may evaluate to adifferent value at different times, such as when market data changes.When the algorithm is active, the order being managed is entered intothe market and worked according to the determined price and quantity, asdiscussed above. When the algorithm is inactive, the order being managedis removed from the market. This may be achieved by deleting the order,for example.

In certain embodiments, the algorithm area 210 does not include theconditional area 213. Instead, the algorithm may simply always be“active” once the order is initiated. For example, in a hedge managerinterface, because the hedge order may be desired to be filled asquickly as possible, the algorithm managing the hedge order may alwaysbe active.

If the expressions in the price area 211, the quantity area 212, and/orthe conditional area 213 do not evaluate to the proper type of value (anumber for the price area 211 and the quantity area 212 and a Booleanvalue for the conditional area 213), the expression is invalid. Toindicate that the expression is invalid, the background of theparticular area may be changed from green (indicating a validexpression) to red (indicating an invalid expression). When anexpression in one of the areas of the algorithm area 210 is invalid, anorder cannot be placed.

In certain embodiments, other indicators besides (or in addition to)background color may be used to indicate that the expression in an areaof the algorithm area 210 is invalid. For example, a differentbackground pattern, a different border color or style, a text messagesuch as “Ready” or “Invalid,” and/or an icon of an exclamation point maybe used.

If the order being managed according to the algorithm is filled, acounter order may be automatically placed based on the auto hedge option204 and the scratch quantity 205, as discussed above.

As discussed above, the building block buttons 215 are used to buildexpressions in the algorithm area 210 to define an algorithm. Thebuilding block buttons 215 may also be referred to as icons, movableicons, icon buttons, movable buttons, or user interface elements, forexample. The expressions include elements (logic expressions andparameters) and are evaluated to determine a value for each area of thealgorithm area 210. A building block button 215 may be selected andplaced in a particular area of the algorithm area 210 to build anexpression. For example, a user may drag and drop one or more buildingblock buttons 215 into one or more of the areas of the algorithm area210, such as the price area 211, the quantity area 212, and/or theconditional area 213. As another example, a user may select a buildingblock button 215 by, for example, clicking on it and then it may beplaced in the most recently used algorithm area 210. Placing a buildingblock button 215 in the algorithm area 210 places an element in theexpression being built in the algorithm area 210. As discussed below,certain elements in an expression may include additional elements thatact as sub-expressions, for example.

Types of building block buttons 215 include: instruments, constants,arithmetic operators, logical operators, precedence operators,if-then-else constructs, and variables. Instrument building blockbuttons specify attributes of the selected instrument, such as bid priceand ask quantity, for example. Constant value building block buttonsspecify numeric and Boolean constant values, for example. Arithmeticoperator building block buttons include arithmetic operations such asaddition (“+”), subtraction (“−”), multiplication (“*”), and division(“/”). In addition, arithmetic operator building block buttons mayinclude order-side-specific arithmetic operations such as “+/−”, whichis addition for buy orders and subtraction for sell orders (or additionfor sell orders and subtraction for buy orders, as specified by a user).Logic operator building block buttons include logic operations such asAND, OR, and NOT and comparisons such as greater than (“>”), less than(“<”), greater than or equal to (“>=”), less than or equal to (“<=”),and equal to (“=”), for example. In addition, logic operator buildingblock buttons may include order-side-specific logic operations such as“>/<”, which is greater than for buy orders and less than for sellorders (or greater than for sell orders and less than for buy orders, asspecified by a user). Precedence operator building block buttons includeparentheses (“(” and “)”). In certain embodiments, the precedenceoperator building block buttons may be used to form sub-expressionscomprised of the elements between the parentheses. The if-then-elseconstruct building block button allows for specifying conditionalvalues, for example. The if-then-else construct building block buttonprovides portions where sub-expressions may be built using one or moreelements. Variable building block buttons specify a user-definedvariable that may have its value changed using the variable area 206, asdiscussed above, for example.

FIGS. 2C-2I illustrate building a definition for an algorithm in atrading interface 200 according to certain embodiments.

As illustrated in FIG. 2C, the instrument building block button 231 isselected and placed in the price area 211 as instrument building block232. The instrument building block 232 allows a user to select whichattribute of the selected instrument should be used from the list 233.The instrument bid price has been selected. Thus, the price area 211containing the instrument building block 232 (specified to be theinstrument bid price) evaluates to the instantaneous instrument bidprice in the market.

Examples of attributes of the selected instrument include the bid price,ask price, bid quantity, ask quantity, last traded price, last tradedquantity, volume, trading session high, trading session low, non-impliedbid/ask quantity (also referred to as the real bid/ask quantity),settlement price, minimum tradeable increment (also referred to as thetick size), and number of orders in the queue at a price (also referredto as the headcount). In addition, special order-side-specificattributes may be specified (not shown), such as “bid price*”, “askprice*”, “bid quantity*”, and “ask quantity*”, for example. For thesespecial attributes, the specified value is used for buy orders and theopposite of the specified value is used for sell orders. For example, if“ask price*” is selected, then the expression evaluates to the ask pricefor a buy order and the bid price for a sell order.

As illustrated in FIG. 2D, the subtraction arithmetic operator buildingblock button 241 is selected and placed in the price area 211 assubtraction building block 242. Now the expression in price area 211includes instrument building block 232 and subtraction building block242.

However, the expression in the price area 211 is now invalid and cannotbe evaluated (“bid price-” is not syntactically meaningful). This may behandled similarly to the type of the area being invalid, as discussedabove. That is, since the expression in the price area 211 is invalid,the background of the price area 211 is changed from green (indicating avalid expression) to red (indicating an invalid expression).

As illustrated in FIG. 2E, the numerical constant value building blockbutton 251 is selected and placed in the price area 211 as the constantvalue building block 252. The user has specified that the constant valuebuilding block 252 should have a value of “0.5.” The expression in theprice area 211 is now valid again (notice that the background haschanged from red back to green) and evaluates to the instantaneous bidprice of the instrument minus 0.5.

As illustrated in FIG. 2F, the if-then-else construct building blockbutton 261 is selected and placed in the quantity area 212 as theif-then-else construct building block 262. The if-then-else constructbuilding block 262 includes an IF portion 263, a THEN portion 264, andan ELSE portion 265. Sub-expressions of one or more elements (includingnested if-then-else construct building blocks) may be built in eachportion of the if-then-else construct building block 262. When theif-then-else construct building block 262 is evaluated, its value isdetermined as follows. The IF portion 263 is evaluated to determine aBoolean value. When the determined Boolean value from the IF portion 263evaluates to “true”, then the if-then-else construct building block 262evaluates to the value of the expression in the THEN portion 264. Whenthe determined Boolean value from the IF portion 263 evaluates to“false”, then the if-then-else construct building block 262 evaluates tothe value of the expression in the ELSE portion 265.

The building block buttons 215 are also used to build expressions in theportions of the if-then-else construct building block 262. Asillustrated, the IF portion 263 includes a partially built expressionfor comparing to determine if the instrument bid quantity is greaterthan something. However, since this expression is not syntacticallymeaningful, it is invalid. Note that consequently, the background of theIF portion 263 is red and not green to indicate this. Additionally,because the if-then-else construct building block 262 is not valid(because its IF portion 263 is not valid), the expression in thequantity area 212 is not valid, and therefore it too has a redbackground.

As illustrated in FIG. 2G, the if-then-else construct building block 262now includes valid expressions in each of its portions and therefore theexpression for the quantity area 212 is also valid.

As illustrated in FIG. 2H, if-then-else construct building blocks may benested. The ELSE portion 265 of the if-then-else construct buildingblock 262 includes another if-then-else construct building bock 266. Asillustrated, since the if-then-else construct building block 266 doesnot include any expressions in any of its portions it cannot beevaluated and is therefore an invalid expression in the ELSE portion 265of the if-then-else construct building block 262. Consequently, the ELSEportion 265 has a red background to indicate its expression is invalid.Further, because the ELSE portion 265 has an invalid expression, theif-then-else construct building block 262 does not have a validexpression and therefore the background of the quantity area 212 is red.

As illustrated in FIG. 2I, the expression in the IF portion 263 of theif-then-else construct building block 262 includes variable buildingblocks 273, 274, 275, and 276. The variable building blocks 273, 274,275, and 276 may be placed by using a variable building block button orby selecting an option when using the constant value building blockbutton to indicate that the constant value should be a variable. Thevariable building block 273 displays the name of the variable (“M_TH_1”)and its value (“5000”). This may represent, for example, a minimumthreshold. As discussed above, the variable area 206 displays eachvariable name and its value. As illustrated, variable area 206 includesa name column 271 with entries for each variable building block 273,274, 275, and 276 and a default value column 272 with correspondingdefault value entries for each variable. A user can select a defaultvalue entry in the default value column 272 to change the default valueof the respective variable building block, so that the new default valueis used in the evaluation of the expression in the quantity area 212.Similarly, the user can select a name entry in the name column 271 tochange the name of the respective variable building block. The variablebuilding blocks 273, 274, 275, and 276 may allow a user to manipulatethe behavior of the algorithm, rather than the underlying logic, bychanging the value of the variable, which acts as a parameter to thealgorithm, for example.

The trading interface 200 provides a live evaluation feature. The liveevaluation feature, as illustrated in FIGS. 2C-2I, provides a display ofan evaluation value for an expression. The live evaluation value may beprovided as the algorithm is being defined, for example. The liveevaluation value may be displayed in relation to the expression beingevaluated, for example. The evaluation may be performed whenever anexpression changes or the value of a building block in the expressionchanges. The evaluation may also be performed periodically orcontinuously. In certain embodiments, a live evaluation value may beprovided for sub-expressions. In certain embodiments, a live evaluationvalue may be provided for individual elements of an expression.

As illustrated in FIG. 2C, as discussed above, the instrument bid pricehas been selected as the attribute for the instrument building block232. The live evaluation 281 of the price area 211 displays “8.5”, whichis the current bid price for the instrument (also shown in the marketgrid 202). As illustrated in FIG. 2D, as discussed above, the expressionin the price area 211 is invalid and therefore no live evaluation isdisplayed because the expression cannot be evaluated. As illustrated inFIG. 2E, the live evaluation 282 of the price area 211 displays an “8”,which is the instrument bid price (8.5) minus the constant value (0.5).

In addition to live evaluation of the price area 211, the quantity area212, and the conditional area 213, live evaluation may be performed forexpressions within those areas. For example, as illustrated in FIG. 2G,live evaluations are provided for each of the portions of theif-then-else construct building block 262 as well as for the quantityarea 212 itself. The live evaluation 283 for the IF portion 263 is“True” because the instrument bid quantity (863) is greater than orequal to 60. The live evaluation 284 for the THEN portion 264 is 2because the expression in the THEN portion 264 is just the constantvalue 2. Similarly, the live evaluation 285 for the ELSE portion 265 is1 because the expression in the ELSE portion 265 is just the constantvalue 1. The live evaluation 286 for the quantity area 212 is then “2”because the evaluation of the if-then-else construction building block262 is the value of the THEN portion 264 because the IF portion 263evaluates to “true”.

The building block buttons 215 and algorithm area 210 of the tradinginterface 200 allow a user such as a trader or non-programmer to reducethe time and risk needed to develop an algorithm. This is achieved inpart by reducing or eliminating syntax errors (for example, due to thecomplexities of particular programming languages) and providing liveevaluation and feedback for the algorithm being built (for example, byflagging errors and allowing for debugging of logic while the algorithmis being built).

Once an algorithm has been defined in the algorithm area 210, it may besaved. An algorithm may also be given a name (for example, while thealgorithm is being built and/or when the algorithm is saved). The savedalgorithm may then be recalled or referenced at future time with thetrading interface 200 or with another trading interface. For example,the saved algorithm may be loaded with the trading interface 200 so thatit may be edited or re-used on another order. As another example, thesaved algorithm may be referenced as an order type from another tradinginterface as discussed below.

FIG. 2J illustrates a trading interface 290 according to certainembodiments. The trading interface 290 is an order ticket adapted toprovide for initiating an order managed by an algorithm, where thealgorithm is defined specifically for that order.

The trading interface 290 includes an algorithm area 299, an algorithmorder button 294, and building block buttons 295. The algorithm area 299includes a price area 292, a quantity area 293, and a conditional area294. The price area 291 is similar to the price area 211 discussedabove. The quantity area 292 is similar to the quantity area 212discussed above. The conditional area 293 is similar to the conditionalarea 213 discussed above. The building block buttons 295 are similar tothe building block buttons 215 discussed above.

The trading interface 290 may be used to initiate placement of typicaltrading orders. In addition, the algorithm order button 294 may beselected to enable the algorithm area 299. When enabled, the algorithmorder area 299 provides for defining an algorithm using the price area291, the quantity area 292, and the conditional area 293 in a mannersimilar to that discussed above for the trading interface 200. Once thealgorithm has been defined in the algorithm area 299 and initiated, itis managed according to the defined algorithm in a manner similar tothat discussed above for the trading interface 200.

Similarly, an algorithm area and building block buttons similar to thosein trading interface 200 and 290 may be incorporated into othercomponents of a trading application. For example, a hedge managerinterface may be adapted to incorporate similar features so that analgorithm may be defined and specified to manage a hedge order.

The components, elements, and/or functionality of the trading interface200 and the trading interface 290 discussed above may be implementedalone or in combination in various forms in hardware, firmware, and/oras a set of instructions in software, for example. Certain embodimentsmay be provided as a set of instructions residing on a computer-readablemedium, such as a memory, hard disk, CD-ROM, DVD, EPROM, and/or fileserver, for execution on a general purpose computer or other processingdevice.

III. Algo Design Lab

Certain embodiments provide a design canvas area and blocks fordesigning an algorithm. Certain embodiments provide blocks with complexfunctionality for use in an algorithm. Certain embodiments provide forgrouping blocks placed in the design canvas area. Certain embodimentsprovide for virtualized group blocks enabling dynamic instantiation ofportions of an algorithm to handle particular discrete events. Certainembodiments allow for adjusting both the parameters and the logic of analgorithm rapidly, even during a single trading session. Certainembodiments provide live feedback for blocks as the algorithm is beingdesigned. Certain embodiments provide safety features to reducepotential errors when an algorithm is designed. Certain embodimentsprovide for operation of some or all portions of an algorithm when aconnection between a client device and an algorithm server is broken.Certain embodiments reduce the risks of traditionally programmedalgorithms such as syntax errors, unclear logic, and the need for anon-trader programmer to develop the algorithm as specified by a traderby reducing or eliminating the writing of programming code by a user.Certain embodiments provide a single application for building,debugging, and simulating (with real market data) an algorithm all atthe same time. In addition, the single application may also provide forinitiating the placement of orders using the algorithm.

FIG. 3A illustrates a block diagram of an electronic trading system 300in which certain embodiments may be employed. The system 300 includesone or more client devices 301, one or more algorithm servers 302, andone or more electronic exchanges 303. Each client device 301 is incommunication one or more algorithm servers 302. Each algorithm server302 is in communication with one or more exchanges 303. In addition, incertain embodiments, although not shown in FIG. 3A, a client device 301may also be in communication with one or more exchanges 303.Communication with an exchange by a client device 301 and/or analgorithm server 302 may be done through a gateway similar to thegateway 120, discussed above, for example.

Client device 301 may be similar to client device 110, discussed above,for example. In certain embodiments, the client device 301 may bereferred to as a trader terminal. Exchange 303 may be similar toexchange 130, discussed above, for example.

In certain embodiments, the algorithm server 302 is located physicallynear or at an exchange 303. In certain embodiments, the algorithm server302 is part of the client device 301.

In operation, an algorithm for electronic trading may be designed on aclient device 301. The algorithm may then be communicated to analgorithm server 302. The algorithm server 302 executes the algorithm toperform electronic trading with the exchange 303. Market data may bereceived by the algorithm server 302 for use by the algorithm. Inaddition, market data may be received by the client device 301 for usein designing the algorithm. The market data may be received from theexchange 303, for example. As another example, market data may bereceived from a simulator or from stored/historical data.

FIG. 3B illustrates a trading interface 310 according to certainembodiments. The trading interface 310 is a trading interface for analgorithmic trading application referred to as the Algo Design Lab(“ADL”). The ADL allows a trader to design an algorithm for electronictrading. However, it should be understood that elements of theillustrated trading interface 310 may be incorporated into other tradinginterfaces.

The trading interface 310 includes a design canvas area 311, a blocklist area 312, a variable area 313, and a control area 314. In certainembodiments one or more of these areas may be in separate windows ortoolbars. For example, the block list area 312 may be in a separatewindow from the design canvas area 311.

In operation, an algorithm is defined in the design canvas area 311 byutilizing one or more block from the block list area 312. Default valuesfor user-defined variables in the algorithm may be specified using thevariable area 313. Once the algorithm has been defined, the algorithmmay be simulated using controls in the control area 314 to indicate howthe logic of the algorithm will behave. An order to be managed accordingto the defined algorithm may then be initiated using a tradinginterface.

The design canvas area 311 provides for defining an algorithm. Thedesign canvas area 311 may also be referred to as a whiteboard area. Thedesign canvas area 311 provides a visual programming environment fordesigning the algorithm. Designing an algorithm includes building,testing, simulating, and/or evaluating the algorithm.

In certain embodiments, the design canvas area 311 is the primary focusof the interface for the trading application 310 and may be a large,white space, for example. In the design canvas area 311, blocks may bearranged according to the preference of the user. In certainembodiments, the design canvas area 311 provides grid lines that may beused to arrange the blocks. In certain embodiments, the design canvasarea 311 includes an overview display or map that may be used tonavigate through a large algorithm with many blocks. In certainembodiments, the design canvas area 311 may be zoomed in or out so thata user may see more or less of the algorithm at a time.

Blocks are placed in the design canvas area 311 and connected to definethe algorithm. The blocks to be placed may be selected from the blocklist area 312. Once a block has been placed, it may then be connected toother placed blocks.

The block list area 312 includes one or more blocks which may beselected and placed in the design canvas area 311. Blocks representdifferent functionalities that may be combined according to userpreference to build an algorithm.

In general, blocks have inputs and outputs. However, certain blocks mayhave only inputs and others may have only outputs. For example, a pauseblock may have only an input. As another example, a number block mayhave only an output.

Inputs and outputs of blocks are of one of two primary types: continuousor discrete. A continuous type input/output, at any particular point intime (hence continuous) has a value. A discrete type input/outputreceives/provides discrete events (individual messages/objects)corresponding to specific actions/events that occur at some particularpoint in time. When a specific action/event occurs, a correspondingdiscrete event may be generated.

In addition to the primary type of the input/output, an input/output mayhave a particular value types. For example, a continuous input mighthave a value type of Boolean, number, integer, floating point number, orinstrument. As another example, a block may have two continuous inputsof a variable value type, where the value type for the two inputs may beBoolean or numeric, for example, but must match. An equals block, whichtakes two inputs and compares them to output a Boolean indicatingwhether the inputs are equal may have variable inputs so that it may beused to compare Booleans or numbers or instruments, for example. Asanother example, a discrete output might have a value type of fillconfirmation. That is, the discrete output might provide fillconfirmation discrete events. As another example, a discrete outputmight provide more than one type of discrete event for actions such asorder request confirmations (indicating an order was placed), fillconfirmations (indicating an order was filled or partially filled),order change confirmations (indicating a working order parameters suchas price or quantity was changed), order deletion confirmations(indicating a working order was deleted or cancelled), or tradeconfirmations (indicating a trade has occurred). As another example, adiscrete event may be empty in that it indicates only that an event hasoccurred. An empty discrete event may, for example, be triggered by atimer, a change in a Boolean value, or used to activate a portion of analgorithm at a particular time (such as a time of day or a time whencertain market conditions have been met, for example). A discrete eventof a particular type may include different information than a discreteevent of another type. For example, an order confirmation may includeinformation such as an order identifier and/or an instrument. As anotherexample, a fill confirmation discrete event may include information suchas an order identifier, price, quantity, instrument, and/or time of afill. As another example, an order deletion confirmation may include anorder identifier, instrument, and/or time of deletion. As anotherexample, an empty discrete event may not include any information (or mayinclude only a time the event occurred). A discrete event may includeuser-defined information. For example, a discrete event a fillconfirmation for a filled order for instrument A may includeuser-defined market information such as a bid price in instrument B atthe time of the fill in instrument A.

In certain embodiments, a block includes indicators of the primary typefor its inputs/outputs. For example, continuous inputs/outputs may beindicated with a particular background color, foreground color,background pattern, border color, border style, shape, symbol, number,text, and/or font and discrete inputs/outputs might be indicated withanother color, pattern, border, shape, symbol, number, text, and/orfont.

In certain embodiments, a block includes indicators of the value typefor its inputs/outputs. For example, inputs/outputs with a particularvalue type may be indicated with a particular background color,foreground color, background pattern, border color, border style, shape,symbol, number, text, and/or font and inputs/outputs with a differentvalue type may be indicated with another color, pattern, border, shape,symbol, number, text, and/or font.

In certain embodiments, the primary type and/or the value type of aninput or output is displayed in a pop-up window when a cursor ispositioned near the block. In certain embodiments, information about theconfiguration of a block is displayed in a pop-up window when a cursoris positioned near the block.

Blocks represent different functionality. In the trading interface 310,blocks have been separated into four general categories offunctionality: basic blocks, trading blocks, discrete blocks, andmiscellaneous blocks. However, these groupings are for convenientorganization and utilization by a user; blocks do not need to be groupedand a block's group does not necessitate particular features. Someblocks may appropriately fit in more than one category and otherorganizations or groupings of blocks may also be employed.

Basic blocks generally have continuous inputs and outputs and providearithmetic operations (for example, addition, subtraction,multiplication, and division), logical operations (for example, AND, OR,and comparison such as equality, greater than, and less than), constantvalues (for example, number and Boolean), and if-then-else constructs.

Trading blocks generally provide more complex functionality related tomanipulating an order (for example, placing an order, modifying anexisting order, or deleting an order) or order-related information (forexample, a fill confirmation). Trading blocks may have both continuousand discrete inputs and outputs. For example, a market maker block mayhave continuous inputs for specifying an instrument, price, quantity,and condition for quoting an order and may have a continuous output ofthe working quantity and a discrete output for providing notification offills. Trading blocks allow users, including non-programmers (such astraders), to utilize a visual design environment (such as that providedby the ADL) to create and deploy trading algorithms. The trading blocksmay allow for more rapid and accurate design of an algorithm as comparedto a typical programmer with fewer steps or instructions as compared toother visual programming platforms.

Discrete blocks generally have discrete inputs and outputs and provideoperations based on the occurrence of discrete events. For example, agenerator block may generate an occurrence of a discrete event. Asanother example, a value extractor block may extract a value from adiscrete event and make it available as a continuous value to anotherportion of the algorithm. As another example, a sequencer block may beused to control the sequence in which subsequent blocks are processed inresponse to a discrete event. Certain discrete blocks may store data tobe referenced at a subsequent time. For example, a value accumulatorblock may receive a discrete event and extract a user-specified valuefrom it. The extracted value may be accumulated with values extractedfrom each received discrete event.

Miscellaneous blocks provide a variety of functionality that may notnecessary fit into the above-discussed categories. For example, theseblocks may provide special purpose or more complex calculations or mayadd additional control to the execution of the algorithm itself.Further, miscellaneous blocks may provide more precise tools to controlrisk, convert numbers into tradeable values, or use time (either preciseor elapsed) as an input or variable.

FIG. 3C illustrates examples of blocks 320 that may be used in thetrading interface 310 according to certain embodiments. Example blocksfrom each of the categories identified above are illustrated. Examplebasic blocks include the add block 321 and the if-then-else block 322.Example trading blocks include the market maker block 323, theconditional buy/sell block 324, and the order handler block 325. Examplediscrete blocks include the value extractor block 326 and the branchblock 327. Example miscellaneous blocks include the note block 328 andthe pause block 329. Each of these blocks, along with other examples ofblocks that may be included in certain embodiments are discussed in moredetail below.

Basic blocks may include add, subtract, multiply, divide, greater than,less than, greater than or equal, less than or equal, AND, OR, equals,IF-THEN-ELSE, number, Boolean, and constant blocks, for example.

An add block may add two continuous numeric inputs together to produceone continuous numeric output. The add block may have a triangular shapewith a plus symbol (“+”) in the middle, two continuous inputs on theleft side, and one continuous output on the right side. The add blockmay also be referred to as an adder block.

A subtract block may subtract one continuous numeric input (for example,the bottom input) from a second continuous numeric input (for example,the top input) to produce one continuous numeric output. The subtractblock may have a triangular shape with a minus symbol (“−”) in themiddle, two continuous inputs on the left side, and one continuousoutput on the right side.

A multiply block may multiply two continuous numeric inputs together toproduce one continuous numeric output. The multiplier block may have atriangular shape with a multiplication symbol (“X” or “*”) in themiddle, two continuous inputs on the left side, and one continuousoutput on the right side.

A divide block may divide one continuous numeric input (for example, thetop input) by a second continuous input (for example, the bottom input)to produce one continuous numeric output. The divide block may have atriangular shape with a division symbol (“/” or “÷”) in the middle, twocontinuous inputs on the left side, and one continuous output on theright side.

A greater than block may compare two continuous numeric inputs todetermine if one input (for example, the top input) is greater than asecond input (for example, the bottom input). The output is a continuousBoolean output of TRUE if the first input is greater than the secondinput and FALSE for all other conditions. The greater than block mayhave a rectangular shape on the left side and an arched shape to theright side with a greater than symbol (“>”) in the middle, twocontinuous numeric inputs on the left side, and one continuous Booleanoutput on the right side.

A less than block may compare two continuous numeric inputs to determineif one input (for example, the top input) is less than a second input(for example, the bottom input). The output is a continuous Booleanoutput of TRUE if the first input is less than the second input andFALSE for all other conditions. The less than block may have arectangular shape on the left side and an arched shape to the right sidewith a less than symbol (“<”) in the middle, two continuous numericinputs on the left side, and one continuous Boolean output on the rightside.

A greater than or equal block may compare two continuous numeric inputsto determine if one input (for example, the top input) is greater thanor equal to a second input (for example, the bottom input). The outputis a continuous Boolean output of TRUE if the first input is greaterthan or equal to the second input and FALSE for all other conditions.The greater than or equal block may have a rectangular shape on the leftside and an arched shape to the right side with a greater than or equalto symbol (“>=” or “≥”) in the middle, two continuous numeric inputs onthe left side, and one continuous Boolean output on the right side.

A less than or equal block may compare two continuous numeric inputs todetermine if one input (for example, the top input) is less than orequal to a second input (for example, the bottom input). The output is acontinuous Boolean output of TRUE if the first input is less than orequal to the second input and FALSE for all other conditions. The lessthan or equal block may have a rectangular shape on the left side and anarched shape to the right side with a less than or equal to symbol (“<=”or “≤”) in the middle, two continuous numeric inputs on the left side,and one continuous Boolean output on the right side.

An AND block may perform a logical conjunction of two continuous Booleaninputs such that if a first input (for example, the top input) is TRUEand a second input (for example, the bottom input) is TRUE, then theBoolean output is TRUE. If either of the inputs is FALSE, then theoutput value is FALSE. The AND block may have a rectangular shape on theleft side and an arched shape to the right side with “AND” text in themiddle, two continuous Boolean inputs on the left side, and onecontinuous Boolean output on the right side.

An OR block may perform a logical disjunction of two continuous Booleaninputs such that if either of the inputs is TRUE, then the Booleanoutput is TRUE. If both inputs are FALSE, then the output value isFALSE. The OR block may have a rectangular shape on the left side and anarched shape to the right side with “OR” text in the middle, twocontinuous Boolean inputs on the left side, and one continuous Booleanoutput on the right side.

An equals block may compare two continuous inputs to determine if oneinput (for example, the top input) is equal to a second input (forexample, the bottom input). The inputs may be of variable value type sothat the equals block may accept values such as numeric, Boolean, orinstrument, as long as each input is of the same type. The output is acontinuous Boolean output of TRUE if the two inputs are equal and FALSEfor all other conditions. The equals block may have a rectangular shapeon the left side and an arched shape to the right side with an equalssymbol (“=”) in the middle, two continuous variable inputs on the leftside and one continuous Boolean output on the right side. The equalsblock may also be referred to as an equality block.

An IF-THEN-ELSE block may have three continuous inputs: a Boolean IFinput, a variable THEN input, and a variable ELSE input. TheIF-THEN-ELSE block has one continuous variable output. If the IF inputvalue is TRUE, the output is the value of the THEN input. If the IFinput value is FALSE, the output is the value of the ELSE input. TheIF-THEN-ELSE block may have a rectangular shape with a “?” symbol in themiddle, one continuous Boolean IF input and two continuous variable ELSEand THEN inputs on the left side, and one continuous variable output onthe right side.

A number block may have one continuous numeric output that provides anumeric value specified by the user. When placed, the user may beprompted to enter the numeric value for the number block. Alternatively,the number block may default to a predefined value such as 1. Inaddition, the value may be specified to the order ticket quantity ororder ticket price. If so, the value of the number block will be therespective value specified when an order is initiated to be managedusing the algorithm. The specified value may be changed by the userduring the design of the algorithm by, for example, selecting the numberblock and using an action such as a menu item or double-click to beprompted to enter a value. The specified value may also be changed ifthe number block is specified to be variable using the variable area 313discussed below. The number block may have a circular shape with thespecified number in the middle and one continuous numeric output on theright side. This block may also be referred to as a constant numberblock.

A Boolean block may have one continuous Boolean output that provides aBoolean value specified by the user. When placed, the user may beprompted to enter the Boolean value for the Boolean block.Alternatively, the Boolean block may default to a predefined value suchas TRUE. The specified value may be changed by the user during thedesign of the algorithm by, for example, selecting the Boolean block andusing an action such as a menu item or double-click to be prompted toenter a value. The specified value may also be changed if the Booleanblock is specified to be variable using the variable area 313 discussedbelow. The Boolean block may have a circular shape with the specifiedBoolean value displayed textually in the middle and one continuousBoolean output on the right side. This block may also be referred to asa constant Boolean block.

In certain embodiments, the number block and the Boolean block may beconsolidated into a single block such as a constant block. A constantblock may have one continuous variable output that provides a valuespecified by the user. When placed, the user may be prompted to enterthe value type and value for the constant block. Alternatively, theconstant block may default to a predefined value type such as numericand a predefined value such as 1. In addition, the value may bespecified to the order ticket quantity or order ticket price. If so, thevalue of the constant block will be the respective value specified whenan order is initiated to be managed using the algorithm. The specifiedvalue may be changed by the user during the design of the algorithm by,for example, selecting the constant block and using an action such as amenu item or double-click to be prompted to enter a value. The specifiedvalue may also be changed if the constant block is specified to bevariable using the variable area 313 discussed below. The constant blockmay have a circular shape with the specified value displayed textuallyin the middle and one continuous variable output on the right side. Incertain embodiments, the constant block may also support specifying aninstrument for value, similar to the instrument block discussed below.

Trading blocks may include instrument, instrument attribute, marketmaker, legger, custom spread, responsive buy/sell, conditional buy/sell,order handler, IF-THEN-ELSE instrument, instrument attribute at price,spread between, trade, order, fill calculator, and fill accumulatorblocks, for example.

An instrument block may have one continuous instrument output thatprovides an instrument name. The instrument name may be anexchange-listed instrument or a synthetic instrument, for example. Whenplaced, the user may be prompted to specify the instrument name for theinstrument block. The instrument name may be selected from a list, forexample. Alternatively, the instrument block may default to a predefinedvalue. The specified value may be changed by the user during the designof the algorithm by, for example, selecting the instrument block andusing an action such as a menu item or double-click to be prompted toenter a value. The specified value may also be changed if the instrumentblock is specified to be variable using the variable area 313.

An instrument attribute block may have a continuous instrument input anda continuous numeric output. The instrument attribute block may take aninstrument name and output a value for a specified attribute of thatinstrument. Attributes may include best bid quantity, best bid price,best ask quantity, best ask price, volume, session high price, sessionlow price, minimum tradeable increment, last traded price, last tradedquantity, total quantity (total quantity traded at the last tradedprice, until a trade occurs at a new price), settlement price fromprevious trading session, real (non-implied) best bid quantity, real(non-implied) best ask quantity, bid headcount (number of orders in themarket at the best bid price), ask headcount (number of orders in themarket at the best ask price), or position (user's overall inventor in aparticular instrument). When placed, the user may be prompted to enterthe attribute to be provided by the instrument attribute block.Alternatively, the instrument attribute block may default to apredefined value such as bid quantity. The specified attribute may bechanged by the user during the design of the algorithm by, for example,selecting the instrument attribute block and using an action such as amenu item or double-click to be prompted to enter an attribute. Thespecified attribute may also be changed if the instrument attributeblock is specified to be variable using the variable area 313 discussedbelow.

A market maker block may submit a buy or sell order for a tradeableobject specified by a continuous instrument input at a price andquantity specified by two continuous numeric inputs, when the conditioncontinuous Boolean input is TRUE. The condition input is optional anddefaults to TRUE if no input is provided. The market maker block maydelete the order when the condition input is FALSE. The market makerblock may also modify an existing order's price or quantity if therespective price and quantity input values change. The value specifiedin the quantity input represents the maximum desired fill quantity,taking into account prior fills. For example, if quantity input value of5 is provided, an order for 5 may be entered into a market and if aquantity of 3 is filled, an order of 2 will continue to be worked, evenif the price input changes. If the quantity input changes, the orderworked will be for the new quantity specified minus the already filledquantity of 3. The market maker block may provide one or more discreteoutputs that provide fill confirmation and/or order request discreteevents. The market maker block may include an option to specify thatorders generated by the market maker block should stay in the order bookeven if the algorithm is deleted, halted, stopped, or paused. Thisfeature may be useful for hedging portions of algorithms, for example.The market maker block may include an option to specify that an ordergenerated by the market maker block is to be marked as hung while it isdisplayed in the order book, which may make it easier to identify animproperly functioning or incomplete algorithm (if, for example, ordersare not expected to stay in the order book). The market maker block mayalso include an option to specify a color or textual flag to beassociated with orders placed by the market maker block to make themeasier to identify in an order window, for example.

A legger block may submit buy or sell orders for tradeable objects oflegs of a custom spread, where the tradeable objects for each leg arespecified by a continuous instrument input. The price and quantitydesired for the custom spread are specified by two continuous numericinputs. The legger block works an individual order(s) for the spreadwhen the condition continuous Boolean input is TRUE. The condition inputis optional and defaults to TRUE if no input is provided. The leggerblock may delete the order(s) when the condition input is FALSE. Thelegger block may also modify the price and/or quantity of a workingorder(s) if the price and/or quantity input values change. The valuespecified in the quantity input represents the maximum desired fillquantity of the spread, taking into account prior fills. For example, ifquantity input value of 5 is provided, an order for 5 may be enteredinto a market and if a quantity of 3 is filled, an order of 2 willcontinue to be worked, even if the price input changes. If the quantityinput changes, the order worked will be for the new quantity specifiedminus the already filled quantity of 3. The legger block may provide oneor more discrete outputs that provide spread fill, order request, and/orleg fill discrete events. After instruments have been provided for thelegs of the spread, the legger may be configured by, for example,selecting the legger block and using an action such as a menu item ordouble-click to be prompted to specify parameters and settings.Parameters that may be specified for each leg of the spread include“multiple” (the coefficient of the spread leg), “trade quantity”(quantity for each leg of the spread, where a positive number is a buyand a negative number is a sell), “work market?” (toggle whether the legof the spread will actively quote), “net change” (toggle whether toconvert the custom spread calculation to a net change rather thanprice), “pay-up ticks” (number of minimum price increments through whichthe custom spread will enter a limit order on a lean leg; a positivenumber means more aggressive to get filled, a negative number means lessaggressive to get filled), and “lean ratio” (quantity units required toexist on a lean leg in order to work one quantity unit on a quoting leg;this may be a ratio of quantity between the two legs or an thresholdquantity in the lean leg, for example). Settings that may be specifiedinclude “side” (buy or sell the custom spread), “always work insidemarket” (toggle that, when true, legger block will only work individualleg orders that appear on the best or inside market and, in certainembodiments, will only work the leg more likely to get filled asdetermined by looking at market bid/ask size ratios), “disable ‘sniping’mode” (toggle the default behavior that if the legger block can achievethe desired spread price, it will delete the current working orders andsimultaneously submit orders on all legs to get filled at the desiredspread price; when disabled, the legger block will only work thespecified “work market?” legs even if the desired price becomesmomentarily available), “clip size” (quantity to be worked at one timeincrementally increasing until the total quantity has been filled asdefined by the provided spread quantity input), and “flag” (specifies auser-defined flag associated with a spread fill discrete event to makeidentifying them easier). The legger block may include an option tospecify that orders generated by the legger block should stay in theorder book even if the algorithm is deleted, halted, stopped, or paused.The legger block may include an option to specify that an ordergenerated by the legger block is to be marked as hung while it isdisplayed in the order book, which may make it easier to identify animproperly functioning or incomplete algorithm (if, for example, ordersare not expected to stay in the order book). The legger block may alsoinclude an option to specify a color or textual flag to be associatedwith orders placed by the legger block to make them easier to identifyin an order window, for example. This block may also be referred to asan autospreading block or a spreader block.

A custom spread block may submit buy or sell orders for tradeableobjects of legs of a custom spread, where the custom spread is providedas an instrument from an external application. The price and quantitydesired for the custom spread are specified by two continuous numericinputs. The custom spread block works an individual order(s) for thespread when the condition continuous Boolean input is TRUE. Thecondition input is optional and defaults to TRUE if no input isprovided. The custom spread block may delete the order(s) when thecondition input is FALSE. The custom spread block may also modify theprice and/or quantity of a working order(s) if the price and/or quantityinput values change. The value specified in the quantity inputrepresents the maximum desired fill quantity of the spread, taking intoaccount prior fills. For example, if quantity input value of 5 isprovided, if a quantity of 3 is filled, an order of 2 will continue tobe worked, even if the price input changes. If the quantity inputchanges, the order worked will be for the new quantity specified minusthe already filled quantity of 3. The custom spread block may include anoptional Boolean input to enable dynamic sizing of the order quantitiesof the legs of the individual orders instead of requiring the originalorder quantity to be present on hedging legs. The custom spread blockmay provide one or more discrete outputs that provide fill confirmationand/or order request discrete events. When placed, the user may beprompted to specify a custom designed instrument from an externalapplication, where the custom designed instrument provides syntheticmarket data representing a trading strategy. Alternatively, specifiedcustom designed instrument may be specified and/or changed by the userduring the design of the algorithm by, for example, selecting the customspread block and using an action such as a menu item or double-click tobe prompted to specify the custom designed instrument from an externalapplication. Additionally, during the design of the algorithm, a usermay specify settings that may include “disable ‘sniping’ mode” (togglethe default behavior that if the custom spread block can achieve thedesired spread price, it will delete the current working orders andsimultaneously submit orders on all legs to get filled at the desiredspread price; when disabled, the custom spread block will only work thespecified quoting legs even if the desired price becomes momentarilyavailable) and “clip size” (quantity to be worked at one timeincrementally increasing until the total quantity has been filled asdefined by the provided spread quantity input). The custom spread blockmay include an option to specify that orders generated by the customspread block should stay in the order book even if the algorithm isdeleted, halted, stopped, or paused. The custom spread block may includean option to specify that an order generated by the custom spread blockis to be marked as hung while it is displayed in the order book, whichmay make it easier to identify an improperly functioning or incompletealgorithm (if, for example, orders are not expected to stay in the orderbook). The custom spread block may also include an option to specify acolor or textual flag to be associated with orders placed by the customspread block to make them easier to identify in an order window, forexample. In certain embodiments, a custom spread block may provide aspecified custom designed instrument from an external application as acontinuous instrument output. In certain embodiments, a custom spreadblock may provide a specified numeric or Boolean value from an externalapplication as a continuous numeric or Boolean output. This block mayalso be referred to as a custom strategy block or custom externalapplication block.

A responsive buy/sell block may initiate placement of a buy or sellorder for an instrument specified by a continuous instrument input whena discrete event is received on a discrete input. The price and/orquantity to place the order at may be provided by continuous numericinputs. Alternatively, the price and/or quantity may be specified byuser-defined equations that are evaluated to determine the respectiveprice or quantity value to be used. In certain embodiments, one of theprice and quantity may be provided by a continuous numeric input and theother may be provided by evaluating a user-defined equation. Thespecified equation(s) for price and/or quantity (if used) may be changedby the user during the design of the algorithm by, for example,selecting the responsive buy/sell block and using an action such as amenu item or double-click to be prompted to enter the equation(s). Anequation may be entered textually or using building block buttonssimilar to the building block buttons 215 discussed above, for example.Once the responsive buy/sell block has initiated placement of the order,the order is not updated based on subsequent changes in the providedprice and/or quantity values. The responsive buy/sell block may includean option to specify that orders generated by the responsive buy/sellblock should stay in the order book even if the algorithm is deleted,halted, stopped, or paused. The responsive buy/sell block may include anoption to specify that an order generated by the responsive buy/sellblock is to be marked as hung while it is displayed in the order book,which may make it easier to identify an improperly functioning orincomplete algorithm (if, for example, orders are not expected to stayin the order book). The responsive buy/sell block may also include anoption to specify a color or textual flag to be associated with ordersplaced by the responsive buy/sell block to make them easier to identifyin an order window, for example.

A conditional buy/sell block may initiate placement of a buy or sellorder for an instrument specified by a continuous instrument input at aprice and quantity specified by two continuous numeric inputs, when thecondition continuous Boolean input is TRUE. The condition input isoptional and defaults to TRUE if no input is provided. The conditionalbuy/sell block does not delete the order when the condition input valueis FALSE (but an placement of an order is not initiated until thecondition input becomes TRUE). The conditional buy/sell block may onlysubmit one order at a time. In certain embodiments, the conditionalbuy/sell block will continue to submit orders (one at a time) to try toachieve the initially provided quantity value, even if the orders may bedeleted (for example, by another block in the algorithm or manually by auser). Once the conditional buy/sell block has initiated placement ofthe order, the order is not updated based on subsequent changes in theprovided price and/or quantity values. The conditional buy/sell blockmay provide one or more discrete outputs that provide fill confirmationand/or order request discrete events. The conditional buy/sell block mayinclude an option to specify that orders generated by the conditionalbuy/sell block should stay in the order book even if the algorithm isdeleted, halted, stopped, or paused. The conditional buy/sell block mayinclude an option to specify that an order generated by the conditionalbuy/sell block is to be marked as hung while it is displayed in theorder book, which may make it easier to identify an improperlyfunctioning or incomplete algorithm (if, for example, orders are notexpected to stay in the order book). The conditional buy/sell block mayalso include an option to specify a color or textual flag to beassociated with orders placed by the conditional buy/sell block to makethem easier to identify in an order window, for example.

An order handler block may receive an order event on a discrete inputand manage the corresponding order based on price and quantity valuesprovided by two continuous numeric inputs. If a value provided on acontinuous Boolean input becomes TRUE, the order is deleted. The orderhandler block may provide one or more discrete outputs that provide fillconfirmation, delete confirmation, and/or change confirmation discreteevents. The order handler block may provided working quantity and/orfilled quantity on continuous numeric outputs. The order handler blockmay include an option to specify that orders managed by order handlerblock should stay in the order book even if the algorithm is deleted,halted, stopped, or paused.

An IF-THEN-ELSE instrument block may have three continuous inputs: aBoolean IF input, an instrument THEN input, and an instrument ELSEinput. The IF-THEN-ELSE instrument block has one continuous instrumentoutput. If the IF input value is TRUE, the output is the instrumentvalue of the THEN input. If the IF input value is FALSE, the output isthe instrument value of the ELSE input. The IF-THEN-ELSE instrumentblock may have a rectangular shape with a “?” symbol in the middle, onecontinuous Boolean IF input and two continuous instrument ELSE and THENinputs on the left side, and one continuous instrument output on theright side. The IF-THEN-ELSE instrument block is similar to theIF-THEN-ELSE block discussed above but specialized for instrumentvalues.

An instrument attribute at price block may have a continuous instrumentinput, a continuous numeric input, and a continuous numeric output. Theinstrument attribute at price block may take an instrument name(provided by the continuous instrument input) and a price (provided bythe continuous numeric input) and output a value for a specifiedattribute of that instrument at the specified price. Attributes mayinclude bid quantity, ask quantity, real (non-implied) bid quantity,real (non-implied) ask quantity, bid headcount (number of bid orders inthe market at the specified price), and ask headcount (number of askorders in the market at the specified price). When placed, the user maybe prompted to enter the attribute to be provided by the instrumentattribute at price block. Alternatively, the instrument attribute atprice block may default to a predefined value such as bid quantity. Thespecified attribute may be changed by the user during the design of thealgorithm by, for example, selecting the instrument attribute at priceblock and using an action such as a menu item or double-click to beprompted to enter an attribute. The specified attribute may also bechanged if the instrument attribute at price block is specified to bevariable using the variable area 313 discussed below.

A spread between block may have two continuous instrument inputs and acontinuous instrument output. The spread between block may take twoinstrument names (for example, one from a “front leg” input and theother from a “back leg” input) and output an instrument namecorresponding to the exchange listed spread of the two providedinstruments (for example, “front leg-back leg”). For example, a spreadbetween block may be used to reference a spread between two differentinstruments such as “CLZ0” (December Crude 2010) and “CLF1” (JanuaryCrude 2011). These “legs” may be referred to as the “front leg” and“back leg,” respectively. The corresponding output of the spread betweenblock is the exchange listed spread instrument, in this example theexchange listed instrument “CLZ0-CLF1” (the December 2010-January 2011spread market). This block may be used to improve programming safety toreduce errors in the process of correctly referencing spreads betweeninstruments. For example, the two input instruments may be denoted asvariables that can be changed when the algorithm is running or specifiedto be different exchange listed spreads for different orders beingmanaged by the algorithm. The spread between block provides safety byfinding the “correct” listed spread instrument without needing a thirdvariable to be set or changed to match the two individual instrumentvariables. The spread between block may also be used to locate or searchfor the existence of certain exchange listed spreads.

A trade block may provide trade data in discrete events on a discreteevent output for an instrument provided on a continuous instrumentinput. The discrete events include trade price and trade quantity valuesassociated with each trade. The trade data may be received from anexchange, for example. The trade price and trade quantity may beextracted from the discrete events by a value extractor block, a valueaccumulator block, a discrete min block, and/or a discrete max block,for example.

An order block may allow an existing order (that is, an order that hasalready been placed outside of the algorithm and is not being managed byanother algorithm) to be managed according to the defined algorithm. Forexample, the order block may be used to provide particular types ofauto-hedging routines to limit orders that have been placed manually bya user. The order block provides a continuous instrument output of theinstrument the existing order is for and continuous numeric outputs forthe quantity, price, and executed quantity for the existing order. Theorder block also provides a discrete output for order discrete eventsrelated to the order such as fill confirmations. In certain embodiments,if a defined algorithm includes an order block it may be presented in alist of available algorithms to be applied to an existing order in atrading interface include an order window, for example. As anotherexample, an order identifier may be provided as a variable to thealgorithm when it is run or specified in the order block itself. Whenapplied to the existing order, the defined algorithm including the orderblock may then manage the order according to the algorithm.

A fill calculator block may provide a discrete output for spread filldiscrete events. The fill calculator block may be used when thealgorithm buys/sells a custom spread without using a legger block or acustom spread block. The fill calculator block receives multiplecontinuous instrument inputs and a discrete input for each tradeexecution (fill) leg of the spread, the former providing the instrumentsfor the legs and the latter providing discrete events for fillconfirmations. After instruments have been provided for the legs of thespread, the fill calculator block may be configured by, for example,selecting the fill calculator block and using an action such as a menuitem or double-click to be prompted to specify parameters and settings.Parameters that may be specified for each leg of the spread include“multiple” (the coefficient of the spread leg), “trade quantity”(quantity for each leg of the spread, where a positive number is a buyand a negative number is a sell), and “net change” (toggle whether toconvert the custom spread calculation to a net change rather thanprice). Settings that may be specified include “side” (buy or sell thecustom spread for the fill calculator) and “flag” (specifies auser-defined flag associated with a spread fill discrete event to makeidentifying them easier).

An accumulator block may receive an order or fill discrete event on adiscrete input and provide on a continuous numeric output theaccumulated quantity for the received discrete events. For example, ifan accumulator block is connected to a market maker block, theaccumulator block may increase the value of its continuous numericoutput for each partial fill discrete event received from the marketmaker block. This block may be used to keep track of the total number offills, for example. The accumulator block may be a pass-through block soeach discrete event received is passed out through a correspondingdiscrete output. The accumulator block may include a reset discreteinput which, upon receiving an event, will reset the accumulatedquantity to 0. The accumulator block may be similar to the valueaccumulator block discussed below but with more restricted functionalitybecause it accumulates only the filled quantity.

Discrete blocks may include generator, value extractor, valueaccumulator, value bucket, discrete moving average, state, branch,multiplexer, funnel, sequencer, discrete min, and discrete max blocks,for example.

A generator block may provide a discrete event on a discrete outputwhenever a condition is TRUE. The condition may be provided by acontinuous Boolean input so that whenever the condition input becomesTRUE, an event is generated. Alternatively, the condition may bespecified to be an event such as: “on start” (the condition is TRUE whenthe algorithm is started and FALSE thereafter so that a single discreteevent is provided when the algorithm is started), “on change” (thecondition is TRUE whenever the continuous Boolean input value changes sothat going from TRUE to FALSE or FALSE to TRUE both generate a discreteevent), “every X” (the condition is TRUE once each specified timeinterval, where the interval may be specified in minutes, seconds, ormilliseconds).

A value extractor block may receive a discrete event on a discrete inputand extract a user-specified value from the event. Alternatively, thevalue extractor block may, when the discrete event is received, evaluatea user-defined equation to determine the extracted value. The exactedvalue may then be provided on a continuous output. The value type of theoutput depends on the type of value extracted. The following expressionsmay be available for use in specifying the value to be extracted fromthe discrete event: “instrument” (providing the instrument associatedwith the discrete event), “fill price” (providing the fill priceassociated with the discrete event), “fill quantity” (providing the fillquantity associated with the discrete event), “order quantity”(providing the order quantity associated with the discrete event),“order price” (providing the order price associated with the discreteevent), “executed quantity” (providing the accumulation of fills withregard to the order quantity), “working quantity” (providing theaccumulation of a non-executed order quantity at a specific orderprice), “trade quantity” (providing the quantity of a trade executed atan exchange), “trade price” (providing the price of a trade executed atan exchange), and “variable” (providing the value of a specifieduser-defined variable or the value of any other block output in thealgorithm that is not part of a virtualized group block). In certainembodiments, the value extractor block may reference a value fromanother block's output. The value may be referenced using a “variable”expression discussed above or the value may be provided to a continuousvariable input of the value extractor block, for example. The valueextractor block may be a pass-through block so each discrete eventreceived is passed out through a corresponding discrete output.

A value accumulator block may receive a discrete event on a discreteinput and extract a user-specified value from the event to accumulatethe value as each discrete event is received. The accumulated value isprovided on a continuous numeric output. The following expressions maybe available for use in specifying the value to be extracted from thediscrete event: “fill price” (providing the fill price associated withthe discrete event), “fill quantity” (providing the fill quantityassociated with the discrete event), “order quantity” (providing theorder quantity associated with the discrete event), “order price”(providing the order price associated with the discrete event),“executed quantity” (providing the accumulation of fills with regard tothe order quantity), “working quantity” (providing the accumulation of anon-executed order quantity at a specific order price), “trade quantity”(providing the quantity of a trade executed at an exchange), “tradeprice” (providing the price of a trade executed at an exchange), and“variable” (providing the value of a specified user-defined variable orthe value of any other block output in the algorithm that is not part ofa virtualized group block). The value accumulator block may be apass-through block so each discrete event received is passed out througha corresponding discrete output. The value accumulator block may includea reset discrete input which, upon receiving an event, will reset theaccumulated value to 0. The value accumulator block is similar to theaccumulator block discussed above but supports more flexibleconfiguration of what value is accumulated.

A value bucket block may provide for creating a table of key-valuepairs. The table may be a hash table, for example. The key for the tableof the value bucket block is referred to as a bucket hole. The value forthe table corresponding to a particular bucket hole (that is, the key ofthe table) is referred to as a bucket value. The value bucket blockreceives a discrete event on a discrete input. When the discrete eventis received, a user-defined equation for the bucket hole is evaluated todetermine the appropriate entry in the table. A user-defined equationfor the bucket value is then evaluated to determine a new bucket valuefor the entry in the table corresponding to the determined bucket hole.As discussed below, the new bucket value may be combined with or replacethe previous bucket value. When placed, the user may be prompted toenter the equations for the bucket hole and bucket value. Alternatively,the value bucket block may default to predefined equations such as abucket hole of “0” and a bucket value of “0”. The specified equationsmay be changed by the user during the design of the algorithm by, forexample, selecting the value bucket block and using an action such as amenu item or double-click to be prompted to enter one or both of thebucket hole and bucket value equations. The equations may be enteredtextually or using building block buttons similar to the building blockbuttons 215 discussed above, for example. Expressions available for usein specifying the equations (which may be provided by building blockbuttons) may include “instrument” (providing the instrument associatedwith the discrete event), “fill price” (providing the fill priceassociated with the discrete event), “fill quantity” (providing the fillquantity associated with the discrete event), “order quantity”(providing the order quantity associated with the discrete event),“order price” (providing the order price associated with the discreteevent), “executed quantity” (providing the accumulation of fills withregard to the order quantity), “working quantity” (providing theaccumulation of a non-executed order quantity at a specific orderprice), “trade quantity” (providing the quantity of a trade executed atan exchange), “trade price” (providing the price of a trade executed atan exchange), and “variable” (providing the value of a specifieduser-defined variable or the value of any other block output in thealgorithm that is not part of a virtualized group block). As part ofspecifying the value bucket equation, a user may also configure how anew bucket value is combined with the previous bucket value. Forexample, the new bucket value may be added to the previous bucket value(providing for a summation of the bucket values determined for the samebucket hole for each received discrete event). As another example, anaverage of the bucket values determined for the same bucket hole may bedetermined. As another example, the new bucket value may replace theprevious bucket value (providing the most recent value as the bucketvalue for a particular bucket hole). The value bucket may default tosumming the bucket values for a particular bucket hole, for example. Thevalue bucket block may be a pass-through block so each discrete eventreceived is passed out through a corresponding discrete output. Thevalue bucket block may also have a hole continuous numeric input thatprovides a value to be used as the bucket hole so that the correspondingbucket value for the provided bucket hole is provided on a valuecontinuous numeric output. The value bucket block may include a resetdiscrete input which, upon receiving an event, will reset the storedtable.

A discrete moving average block may provide a moving average for a valuedetermined by evaluating a specified user-defined equation each time adiscrete event is received at a discrete input. The number of datapoints to be used in determining the moving average is specified by acontinuous numeric input. The moving average is provided to a continuousnumeric output. The discrete moving average block may keep a list of theevaluated data points until the number of data points specified by thecorresponding input has been reached, at which point the newest datapoint may be added to the list, the oldest removed from the list, andthe moving average be calculated over the data points in the list. Whenplaced, the user may be prompted to enter the equation to be evaluated.Alternatively, the discrete moving average block may default to apredefined value such as 0 for the equation. The specified equation maybe changed by the user during the design of the algorithm by, forexample, selecting the discrete moving average block and using an actionsuch as a menu item or double-click to be prompted to enter an equation.The equation may be entered textually or using building block buttonssimilar to the building block buttons 215 discussed above, for example.Expressions available for use in specifying the equation (which may beprovided by building block buttons) may include “instrument” (providingthe instrument associated with the discrete event), “fill price”(providing the fill price associated with the discrete event), “fillquantity” (providing the fill quantity associated with the discreteevent), “order quantity” (providing the order quantity associated withthe discrete event), “order price” (providing the order price associatedwith the discrete event), “executed quantity” (providing theaccumulation of fills with regard to the order quantity), “workingquantity” (providing the accumulation of a non-executed order quantityat a specific order price), “trade quantity” (providing the quantity ofa trade executed at an exchange), “trade price” (providing the price ofa trade executed at an exchange), and “variable” (providing the value ofa specified user-defined variable or the value of any other block outputin the algorithm that is not part of a virtualized group block). Thediscrete moving average block may also take a discrete input that is areset input. When a discrete event is received by the reset input, therecorded data points are discarded. This may result in the movingaverage output being 0 or “Not a Number” (NaN). The discrete movingaverage block may also provide an OK continuous Boolean output thatindicates whether a sufficient number of data points have been recordedto fully calculate the moving average. The OK output is FALSE until theneeded number of data points have been recorded and TRUE thereafter(until reset). For example, if the number of data points input providesa value of 20, 20 data points (that is, 20 evaluations of the specifiedequation, each triggered by the receipt of a discrete event) will needto be recorded before the OK output becomes TRUE. The discrete movingaverage block may also provide a number of data points continuousnumeric output that indicates the number of data points that have beenrecorded. The discrete moving average block may be a pass-through blockso each discrete event received is passed out through a correspondingdiscrete output.

A state block may receive a discrete event on a discrete input andevaluate a conditional for each discrete output to determine whether thediscrete event should be provided on the discrete output. The stateblock may be used to design a state machine which is a model of behaviorcomposed of a finite number of states, transitions between those states,and actions, for example. Multiple state blocks may be linked togethersimilar to a “flow” graph where a user may inspect the way the logicruns when certain conditions are met. Because a current state isdetermined by past states, it may essentially record information aboutthe past. A transition indicates a state change and is described by aconditional that would need to be fulfilled to enable the transition.The state block allows the user to define an exit action and theconditional that defines the transition. For example, in a state blockproviding two discrete outputs each corresponding to a different statetransition, the user specifies a conditional for each. After a discreteevent is received, the state block waits for one or more of theconditionals associated with each transition to become TRUE (if, whenthe discrete event is received, none of the conditionals are TRUE). Whenthe conditional associated with a particular state transition evaluatesto TRUE, the state block provides the discrete event (that has been heldsince it was received) on the output associated with that particularstate transition. A conditional may be provided on a continuous Booleaninput. Alternatively, the conditional may be provided by a specifieduser-defined equation that evaluates to a Boolean value. The specifiedequation may be changed by the user during the design of the algorithmby, for example, selecting the state block and using an action such as amenu item or double-click to be prompted to enter the equation. Theequation may be entered textually or using building block buttonssimilar to the building block buttons 215 discussed above, for example.A state block may be used to evaluate a user defined pattern in a marketsuch as if there are multiple consecutive trades at non-lower prices.These signals may be used as a conditional input into a trading blocksuch as a market maker block, for example. A state block could alsoevaluate information such as whether a discrete event is a buy or a sellfill message, for example. Expressions available for use in specifyingthe equation (which may be provided by building block buttons) mayinclude “instrument” (providing the instrument associated with thediscrete event), “fill price” (providing the fill price associated withthe discrete event), “fill quantity” (providing the fill quantityassociated with the discrete event), “order quantity” (providing theorder quantity associated with the discrete event), “order price”(providing the order price associated with the discrete event),“executed quantity” (providing the accumulation of fills with regard tothe order quantity), “working quantity” (providing the accumulation of anon-executed order quantity at a specific order price), “trade quantity”(providing the quantity of a trade executed at an exchange), “tradeprice” (providing the price of a trade executed at an exchange), and“variable” (providing the value of a specified user-defined variable orthe value of any other block output in the algorithm that is not part ofa virtualized group block).

A branch block may receive a discrete event on a discrete input andevaluate a conditional. If the conditional is TRUE, then the discreteevent will be provided on a first discrete output (the “YES” path) andif the conditional is FALSE, then the discrete event will be provided ona second discrete output (the “NO” path). The conditional may beprovided on a continuous Boolean input. Alternatively, the conditionalmay be provided by a specified user-defined equation that evaluates to aBoolean value. The specified equation may be changed by the user duringthe design of the algorithm by, for example, selecting the branch blockand using an action such as a menu item or double-click to be promptedto enter the equation. The equation may be entered textually or usingbuilding block buttons similar to the building block buttons 215discussed above, for example. A branch block may be used to evaluatewhether the discrete event is a buy or a sell fill event, for example. A“buy?” building block button may be used to build such an equation.Other expressions available for use in specifying the equation (whichmay be provided by building block buttons) may include “instrument”(providing the instrument associated with the discrete event), “fillprice” (providing the fill price associated with the discrete event),“fill quantity” (providing the fill quantity associated with thediscrete event), “order quantity” (providing the order quantityassociated with the discrete event), “order price” (providing the orderprice associated with the discrete event), “executed quantity”(providing the accumulation of fills with regard to the order quantity),“working quantity” (providing the accumulation of a non-executed orderquantity at a specific order price), “trade quantity” (providing thequantity of a trade executed at an exchange), “trade price” (providingthe price of a trade executed at an exchange), and “variable” (providingthe value of a specified user-defined variable or the value of any otherblock output in the algorithm that is not part of a virtualized groupblock).

A multiplexer block may receive a discrete event on a discrete input andprovide the discrete event on a particular discrete output. For example,the multiplexer block may receive a discrete event from an order handlerblock and based on the type of the discrete event (for example, fill,change, or delete), provide it on the appropriate discrete output of themultiplexer block. When placed, the user may be prompted to specifywhich discrete event types for which outputs are provided.Alternatively, the multiplexer block may default to a predefinedconfiguration of providing an output for every discrete event type. Thespecified discrete event types for which outputs are provided may bechanged by the user during the design of the algorithm by, for example,selecting the multiplexer block and using an action such as a menu itemor double-click to be prompted to specify the discrete event types. Themultiplexer block may be used in conjunction with the order handlerblock to manage an order, for example.

A funnel block may receive discrete events on two or more discreteinputs and provide them on a single discrete output. The funnel blockdoes not hold a discrete event, it passes it through to the output. Thefunnel block may be used in conjunction with state blocks that needmultiple inputs, for example.

A sequencer block may guarantee the order in which discrete events arepassed through the outputs. The sequencer block may have a discreteinput and two or more discrete outputs. When a discrete event isreceived at the input, the sequencer block provides the discrete eventto each output in order. That is, in the processing for a receiveddiscrete event, the sequencer blocker will first provide the discreteevent to the first output, and then the discrete event will be providedto the second output, and so on. This may allow a user to preciselydetermine which order blocks which receive discrete inputs are updatedin the algorithm. However, if multiple blocks are connected to the samediscrete output of the sequencer block, the order those blocks receivethe discrete event is unspecified. This block may also be referred to asa sequence block.

A discrete min block may compare two discrete inputs and provide acontinuous numeric output of the minimum value of a specified attribute(for example, trade price, trade quantity, etc.). When a discrete eventis received on one of the inputs, the specified attribute value isextracted from the event and stored. The extracted value is comparedwith the most recently stored value for the other discrete input todetermine which is the smaller value and that value is provided on thecontinuous numeric output. If no discrete event has been received for aninput, the value extracted from the other input may always treated asthe larger value. As an alternative, the value for a particular discreteinput may simply default to 0. The discrete min block may be apass-through block so each discrete event received is passed out througha corresponding discrete output. The discrete min block may include areset discrete input which, upon receiving an event, will reset thestored values for each discrete input and update the minimum outputcorrespondingly.

A discrete max block may compare two discrete inputs and provide acontinuous numeric output of the maximum value of a specified attribute(for example, trade price, trade quantity, etc.). When a discrete eventis received on one of the inputs, the specified attribute value isextracted from the event and stored. The extracted value is comparedwith the most recently stored value for the other discrete input todetermine which is the larger value and that value is provided on thecontinuous numeric output. If no discrete event has been received for aninput, the value extracted from the other input may always treated asthe larger value. As an alternative, the value for a particular discreteinput may simply default to 0. The discrete max block may be apass-through block so each discrete event received is passed out througha corresponding discrete output. The discrete max block may include areset discrete input which, upon receiving an event, will reset thestored values for each discrete input and update the maximum outputcorrespondingly.

Miscellaneous blocks may include min, max, rounding, display to decimal,not, once true, is number, moving average, conditional f(x), numericf(x), average, timer, note, random number, square root, log, and pauseblocks, for example.

A min block may compare two continuous numeric inputs to determine whichis the smaller value and output it. The min block may have a triangularshape with “MIN” text in the middle, two continuous numeric inputs onthe left side, and one continuous numeric output on the right side.

A max block may compare two continuous numeric inputs to determine whichis the larger value and output it. The max block may have a triangularshape with “MAX” text in the middle, two continuous numeric inputs onthe left side, and one continuous numeric output on the right side.

A rounding block may round a number provided by a continuous numericinput to the nearest increment provided by a continuous numeric input toproduce one continuous numeric output. If no increment value isprovided, the round block may round to the nearest integer. In addition,a user may specify one of three options for the rounding block: normalrounding, always up rounding, and always down rounding. Normal roundinguses the traditional rounding rules (for example, 0.5 rounds up to 1 and0.49 rounds down to 0). Always up rounding will round the number to thehigher increment if the value falls between two increments (for example,2.1 rounds up to 3 and 2 rounds to 2). Always down rounding will roundthe number to the lower increment if the value falls between twoincrements (for example, 2.9 will round down to 2 and 2 rounds to 2). Ifno option is specified, the rounding block may default to normalrounding, for example. The rounding block may have a rectangular shapewith “Round” text in the middle, two continuous numeric inputs on theleft side, and one continuous numeric output on the right side.

A display to decimal block may use a number provided by a continuousnumeric input and an instrument provided by a continuous instrumentinput to outputs number in decimal form. For example, a display todecimal block may be utilized if a user wishes to use a number block tofeed a value such as a price into the rest of the algorithm (perhaps asa variable) without having to calculate the value in decimal format. Theuser may be used to seeing the price of the instrument ZN as 117125,which may represent a price of 117 and 12.5/32nds. With the display todecimal block, the number 117125 may be provided as an input, along withthe instrument, and the display to decimal block will convert the numberto the appropriate decimal format value (here, 117.390625) for use bythe rest of the algorithm. The display to decimal block may have arectangular shape with “D2Dec” text in the middle, one continuousinstrument input and one continuous numeric input on the left side, andone continuous numeric output on the right side.

A NOT block may perform a logical negation of a continuous Boolean inputsuch that if the input value is TRUE the output is FALSE and if theinput value is FALSE the output is TRUE. The NOT block may have arectangular shape on the left side and an arched shape to the right sidewith a negation symbol (“!” or “¬”) in the middle, one continuousBoolean input on the left side, and one continuous Boolean output on theright side.

A once true block may provide a continuous Boolean output of TRUE forthe life of the algorithm when a continuous Boolean input turns TRUE.Until the input value become TRUE at least once, the output value of theonce true block is FALSE. Once the input value has become TRUE, the oncetrue block always outputs a value of TRUE regardless if the input valuesubsequently changes. The once true block may have a rectangular shapeon the left side and an arched shape to the right side with “T” text inthe middle, one continuous Boolean input on the left side and onecontinuous Boolean output on the right side. This block may also bereferred to as a once true always true block.

An is number block may provide a continuous Boolean output of TRUE ifthe value provided on a continuous numeric input is a number and outputFALSE if the provided value is “Not a Number” (NaN). The is number blockmay have a rectangular shape on the left side and an arched shape to theright side with “IsNum?” text in the middle, one continuous numericinput on the left side and one continuous Boolean output on the rightside.

A moving average block may take a data value (which may be changing overtime, such as a price or quantity) as a continuous numeric input and anumber of minutes value as a continuous numeric input and provide amoving average over the specified number of minutes as a continuousnumeric output. The moving average block may record the data value everysecond. For example, if a user desires to have a one minute movingaverage, the moving average block will record 60 data points and averagethem for the output. The moving average block may also take a continuousBoolean value that indicates whether the data value input is valid. Thisinput is optional and default to TRUE. When the data value is about tobe recorded (by default once per second), the moving average blockchecks to see if the valid input is TRUE. If so, the data value isrecorded as a data point. If the valid input is FALSE, the data value isnot recorded as a data point. The moving average block may also take adiscrete input that is a reset input. When a discrete event is receivedby the reset input, the recorded data points are discarded. Depending onthe data value being recorded, this may result in the moving averageoutput being 0 or “Not a Number” (NaN). The moving average block mayalso provide an OK continuous Boolean output that indicates whether asufficient number of data points have been recorded to fully calculatethe moving average. The OK output is FALSE until the needed number ofdata points have been recorded and TRUE thereafter (until reset). Forexample, if number of minutes input provides a value of 20 (for a 20minute moving average), 1200 data points (1 data point for every secondover the 20 minute period) will need to be recorded before the OK outputbecomes TRUE. The moving average block may also provide a number of datapoints continuous numeric output that indicates the number of datapoints that have been recorded. The moving average block may have arectangular shape with “MvgAvg” text in the middle, four inputs (2continuous numeric inputs, 1 continuous Boolean input, and 1 discreteinput) on the left side, and three outputs (2 continuous numeric outputsand 1 continuous Boolean output) on the right side.

A conditional f(x) block may evaluate a user-defined equation thatprovides a value for a continuous Boolean output. When placed, the usermay be prompted to enter the equation to be evaluated. Alternatively,the conditional f(x) block may default to a predefined value such asTRUE. The specified equation may be changed by the user during thedesign of the algorithm by, for example, selecting the conditional f(x)block and using an action such as a menu item or double-click to beprompted to enter an equation. The equation may be entered textually orusing building block buttons similar to the building block buttons 215discussed above, for example. In certain embodiments, the conditionalf(x) block may reference a value from another block's output. The valuemay be referenced using a building block button 215 that specifies theblock and output or the value may be provided to a continuous variableinput of the conditional f(x) block. The conditional f(x) block may havea rectangular shape on the left side and an arched shape to the rightside with “f(x)” text in the middle, no inputs on the left side (unlessvalues are referenced in the user-defined equation, in which casecontinuous inputs are provided corresponding to each variable), and onecontinuous Boolean output on the right side.

A numeric f(x) block may evaluate a user-defined equation that providesa value for a continuous numeric output. When placed, the user may beprompted to enter the equation to be evaluated. Alternatively, thenumeric f(x) block may default to a predefined value such as 0. Thespecified equation may be changed by the user during the design of thealgorithm by, for example, selecting the numeric f(x) block and using anaction such as a menu item or double-click to be prompted to enter anequation. The equation may be entered textually or using building blockbuttons similar to the building block buttons 215 discussed above, forexample. In certain embodiments, the numeric f(x) block may reference avalue from another block's output. The value may be referenced using abuilding block button 215 that specifies the block and output or thevalue may be provided to a continuous variable input of the numeric f(x)block. The numeric f(x) block may have a rectangular shape on the leftside and an arched shape to the right side with “f(x)” text in themiddle, no inputs on the left side (unless values are referenced in theuser-defined equation, in which case continuous inputs are providedcorresponding to each variable), and one continuous numeric output onthe right side.

In certain embodiments, the conditional f(x) block and the numeric f(x)block may be consolidated into a single block such as an f(x) block. Anf(x) block may evaluate a user-defined equation that provides either aBoolean or a numeric value for a continuous variable output. Whenplaced, the user may be prompted to enter the equation to be evaluated.Alternatively, the f(x) block may default to a predefined value such as0. The specified equation may be changed by the user during the designof the algorithm by, for example, selecting the f(x) block and using anaction such as a menu item or double-click to be prompted to enter anequation. The equation may be entered textually or using building blockbuttons similar to the building block buttons 215 discussed above, forexample. In certain embodiments, the f(x) block may reference a valuefrom another block's output. The value may be referenced using abuilding block button 215 that specifies the block and output or thevalue may be provided to a continuous variable input of the f(x) block.The f(x) block may have a rectangular shape on the left side and anarched shape to the right side with “f(x)” text in the middle, no inputson the left side (unless values are referenced in the user-definedequation, in which case continuous inputs are provided corresponding toeach variable), and one continuous variable output on the right side.

An average block may average the values of two or more continuousnumeric inputs to produce one numeric continuous output. For example,the average block may have 10 inputs. As another example, the averageblock may begin with one input and each time a connection is made to anaverage block input a new input may be dynamically provided. The valuesof the inputs are summed and then divided by the number of inputsproviding values to produce the output. The average block may have arectangular shape with “AVE” or “AVG” text in the middle, two or morecontinuous numeric inputs on the left side, and one continuous numericoutput on the right side.

A timer block may provide continuous numeric outputs for the hour,minute, and second of a time. For example, the time may be the currenttime. The current time may be the time at the computing device providingthe trading interface to a user or the current time at an algorithmserver, for example. As another example, the time may be from when thealgorithm was started running. As another example, the time may be thetime since the start of the current trading session. As another example,the time may be from 12 am CST of the current trading session. Asanother example, the time may be a time provided by an exchange. Thetimer block may have a rectangular shape with “TIMER” text or a clocksymbol in the middle and three continuous numeric outputs on the rightside.

A note block may provide a text box for users to enter comments andnotes about the algorithm being designed. A note block may not have anyinputs or outputs. When placed, the user may be prompted to enter thetext for the note block. Alternatively, the note block may default to apredefined value such as “Add note here.” The specified value may bechanged by the user during the design of the algorithm by, for example,selecting the note block and using an action such as a menu item ordouble-click to be prompted to enter a value. The note block does notaffect the operation of the algorithm. The note block may have arectangular shape with the text value displayed in the middle.

A random number block may provide a random number to a continuousnumeric output. The random number may be specified to be an integer or afloating point value when the random number block is placed or laterconfigured. The random number block may default to providing an integervalue. The random number may be between a minimum value specified by acontinuous numeric input and a maximum value specified by a continuousnumeric input. If the minimum input is not provided, it may default to0, for example. If the maximum input is not provided it may default tothe maximum integer supported by the computing device for an integeroutput or to 1 for a floating point output. The random number block mayalso have a discrete input to signal when a new random number should beprovided. If a discrete input is not provided, the random number blockmay provide a new random number once per second, for example. The randomnumber block may be a pass-through block so each discrete event receivedis passed out through a corresponding discrete output. The random numberblock may have a square shape with a question mark symbol (“?”) or“RAND” text in the middle, two continuous numerical inputs and onediscrete input on the left side, and one continuous numerical output onthe right side.

A square root block may provide a square root value on a continuousnumeric output for a value provided on a continuous numeric input. Theoutput may be “Not a Number” (NaN) if the input is a negative number.The square root block may have a triangular shape with a square rootsymbol (“✓”) in the middle, one continuous numeric input on the leftside, and one continuous numeric output on the right side.

A log block may provide a logarithm value on a continuous numeric outputfor a value provided on a continuous numeric input. A base value for thelogarithm may be provided on a continuous numeric input. If the basevalue is not provided it may default to the natural logarithm, forexample. The log block may have a square shape with “Log” text in themiddle, two continuous numeric inputs on the left side, and onecontinuous numeric output on the right side.

A pause block may pause the entire algorithm if a discrete event isreceived on a discrete input or if a value provided on a continuousBoolean input becomes TRUE. In certain embodiments, if the Boolean inputvalue becomes FALSE again, the algorithm may resume running. In certainembodiments, once the algorithm has been paused because of the pauseblock, the algorithm must be manually restarted. The pause block may beoctagonal shaped with a red background, “Stop” text in the middle, onecontinuous Boolean input and one discrete input on the left side.

Instructions or logic (herein referred to as programming code)representing the algorithm are generated based on the definition of thealgorithm. In certain embodiments, the programming code is source code(such as human and/or compiler readable text) which may subsequently becompiled. In certain embodiments, the programming code is in anintermediate language. In certain embodiments, the programming codeincludes machine-executable instructions. In certain embodiments,generation of programming code includes compilation of generated sourcecode and/or intermediate language code. In certain embodiments,generation of programming code does not include compilation of generatedsource code and/or intermediate language code and such compilation is aseparate process. The generated programming code (after compilation, ifappropriate) may then be simulated and/or used to trade according to thedefined algorithm. As used herein, where programming code is discussedto be run, executed, and/or simulated, it is assumed that the generatedprogramming code has additionally been compiled, if appropriate to berun, executed, and/or simulated.

In certain embodiments, the programming code is generated as thealgorithm is being designed. Note that while the algorithm is beingdesigned, the definition of the algorithm may be changing as blocksand/or connections are added, modified, and/or removed. In certainembodiments, the programming code is generated automatically when achange is made to the algorithm definition. In certain embodiments, theprogramming code is generated at the request of a user.

In certain embodiments, the programming code is generated by a componentof the algorithmic trading application of the trading interface 310 at aclient device. In certain embodiments, the programming code is generatedby a component of the algorithmic trading application at another device,such as a algorithm generation device, an algorithm server similar tothe algorithm server 302 discussed above, and/or a gateway similar tothe gateway 120 discussed above, for example. In certain embodiments,the programming code is generated by more than one component. Forexample, multiple components of the algorithmic trading application maywork together to generate the code. Such components may be specializedto generate different aspects or functionalities of the programmingcode, for example.

In certain embodiments, the programming code is generated by more thanone device. For example, programming code may be generated by a clientdevice and an algorithm server. The programming code generated based onthe algorithm definition may be different based on which component ordevice is generating it. For example, programming code generated on theclient device may be optimized for execution by the client device and/ormay contain different features (for example, user interface-relatedfunctionality) than programming code generated on an algorithm server(which may not, for example, include user interface-relatedfunctionality). For clarity, unless otherwise noted, the followingdiscussion is with respect to generation of programming code on theclient device, but it should be understood that similar actions aretaken when the programming code is generated at another device such asan algorithm server.

In certain embodiments, the generated programming code is done in anobject-oriented manner using a programming language such as C# and the.NET 4.0 framework.

In certain embodiments, the programming code is generated by traversingeach block and connection in the algorithm definition. For each block,programming code is generated. When generating programming code, someblocks may become primitive variables. For example, an adder block maybecome a floating point variable whose value is set to be the sum of thevalues of the outputs connected to the adder block's inputs, which maybe determined recursively. Other blocks which may have more complexfunctionality may be generated as subclasses derived from base classes.The base class may provide the core functionality associated with thecorresponding block. The generated subclass may then override virtualmethods having return values to provide values specific to the block forwhich the programming code is being generated to the core functionalityof the base class. For example, a market maker block placed in thedesign canvas area 311 may have programming code generated which is asubclass of a base market maker class. The subclass may override virtualmethods to get values for various inputs of the market maker block andto specify whether the market maker block was configured to buy or sell.Unlike the basic blocks discussed above, the market maker block is atrading block which provides more complex functionality.

Continuous connections between blocks specify how the connected outputvalues and input values relate. Continuing the adder example above, thefloating point value representing the output of the adder block may beset to be the sum of the values of other primitive variables(representing other blocks/outputs) connected to the adder block'scontinuous inputs. In certain embodiments, continuous connections may beused to flatten the generated programming code so that multiple blocks(that would generate to primitive variables) with continuous connectionsmay be condensed to simple expressions without using multipleintermediate variables.

Discrete connections between blocks are used to generate eventgenerators and event handlers so that the proper method (the handler) isinvoked when a discrete event is generated. The discrete event is passedfrom the event generator to the event handler to be processed.

When running, the algorithm responds to actions that cause the state ofthe algorithm to change. The actions may include external events such asmarket events (for example, a price update, quantity update, orderconfirmation, trade confirmation, fill confirmation, or tradenotification) or timer events (for example, from a system clock oralarm). These external events may result in discrete events beinggenerated such as order confirmation discrete events, trade confirmationdiscrete events, fill confirmation discrete events, or tradenotification discrete events and/or continuous values such as price orquantity values for an instrument being updated. The actions may alsoinclude internal events such as discrete events generated by blocks inthe algorithm or continuous values changing.

When an internal or external discrete event occurs (for example, a tradeconfirmation discrete event or a generator block generates a discreteevent), each interested block in the algorithm has an event handlermethod invoked so that the block may perform its specified functionalityassociated with the event. The event handlers may be evaluated in anunspecified order. For example, the event handlers may be evaluatedbased on the order their respective blocks were placed in the algorithmdefinition. The event handler processing may include performing theblock's function based on the received event, updating continuous outputvalues, and generating a discrete event and providing it on an output toother connected blocks.

When an internal or external continuous value changes (for example,market data is updated or the system clock's time changes), eachinterested block that is directly or indirectly connected to the sourceof the data (“downstream blocks”) has its value updated to reflect thenew data. Primitive variables that are a result of some blocks will havetheir new values assigned, for example.

If a continuous output value is updated either by a discrete event or acontinuous value change, each directly or indirectly connected block toreceive the updated value is added to a list of blocks to be processed.When the blocks interested in the external event have completed theirprocessing, the list of blocks is then processed so that those blocksmay then act in response to the internal event. Internal events areprocessed in a manner similar to an external event. This process maythen be repeated as each block's processing generates new changes to thestate of the algorithm.

FIGS. 3D-1 through 3D-7 illustrate example programming code generatedaccording to certain embodiments. Note that the programming codeillustrated is only a portion of programming code that may be generatedand is intended to be exemplary and simplified to emphasize certainfeatures for clarity.

Programming code may be generated even when no blocks have been placedin the design canvas area 311, as illustrated in FIG. 3D-1. Thegenerated programming code includes a new class (“CustomAlgorithm0”)which represents the algorithm being designed. This new class is asubclass of an Algorithm class, which provides basic interfaces andfunctionality for effectuating an algorithm with the algorithmic tradingapplication. The CustomAlgorithm0 class may override virtual methods ofthe Algorithm class so that functionality specific to the algorithmbeing designed may be incorporated into the framework of the algorithmictrading application and executed.

Continuing the example, as illustrated in FIG. 3D-2, when a block isplaced in the design canvas area 311, additional programming code may begenerated. As discussed above, some blocks may become primitivevariables and the continuous connections between them tell how theyrelate. For example, as illustrated, two constant number blocks(“ConstantNumberBlock0” and “ConstantNumberBlock1”) have been placed inthe design canvas area 311 as well as an adder block (“AdderBlock0”).Note that the blocks have not been connected. The marked portion of thegenerated programming code illustrates that these basic blocks arerepresented in the programming code as primitive variables (of type“double”).

As illustrated in FIG. 3D-3, connections have been made fromConstantNumberBlock0 and ConstantNumberBlock1 to AdderBlock0.Connections specify the relationship between blocks. The marked portionof the generated programming code illustrates that the value ofAdderBlock0 is equal to the value of ConstantNumberBlock0 plus the valueof ConstantNumberBlock1. This is because the functionality representedby the adder block is to add the values of the two inputs.

As illustrated in FIG. 3D-4, a market maker block has been placed in thedesign canvas area 311. Unlike the basic blocks discussed above, themarket maker block is a trading block which provides more complexfunctionality. The generated programming code adds a new class(“CustomMarketMaker0”) which represents the functionality of theparticular market maker block that has been placed. CustomMarketMaker0is a subclass of MarketMaker, which provides the basic functionality forthe market maker block. The CustomMarketMaker0 class may overridevirtual methods with a return type of the MarketMaker class so thatfunctionality specific to the placed market maker block may beincorporated into the framework of the algorithmic trading applicationand executed. In this case, CustomMarketMaker0 overrides methods thatare invoked by logic in the MarketMaker base class to get the values forthe various inputs of the market maker block. As illustrated in FIG.3D-5, the quantity input of the placed market maker block has beenconnected to the output of the adder block discussed above. The markedportion of the generated programming code illustrates that the virtualmethod “GetQty” of the CustomMarketMaker0 class has been overridden toreturn the value of AdderBlock0.

Continuing the example, as illustrated in FIG. 3D-6, a connection hasbeen made between a discrete output and a discrete input. In particular,a connection was made between the discrete fills output of the marketmaker block and the reset input of a value accumulator block. The valueaccumulator block is a discrete block and similar to a trading block, anew class (“CustomValueAccumulator0”) is added (not shown). The markedportions of the generated programming code illustrate that the newsubclasses (“CustomMarketMaker0” and “CustomValueAccumulator0”) areinstantiated and that the event “DiscreteObjectGenerated” ofMarketMakerBlock0 is linked with event handlers for the CustomAlgorithm0(“InterceptOrderMessage”) and the ValueAccumulatorBlock0(“ProcessResetMessage”). Thus, when the MarketMakerBlock0 has a fillmessage, it will fire the DiscreteObjectGenerated event and all handlersthat have been linked will be notified. In this case, when theProcessResetMessage handler is notified, it will reset the accumulatorvalue to 0.

Continuing the example, as illustrated in FIG. 3D-7, a connection hasbeen made between an instrument block (“SimpleInstrumentBlock0”) and aninstrument attribute block (“InstrumentFieldBlock0”). The instrumentblock is generated to be an instance of the “InstrumentSnapshot” classwhich updates its continuous outputs based on received market data forthe instrument “ESZ0.” The InstrumentSnapshot class provides membervariables or properties that may be referenced to get the correspondingvalue for that attribute of the instrument. For example, when the“SetAllVariables” (setting all values in the algorithm) or“HandleUpdate” (setting values that are affected by the update of aparticular continuous value) methods are invoked, the instrumentattribute block sets its value to be the “.Bid” property of theinstrument block.

FIG. 3E illustrates a trading interface 310 according to certainembodiments. Certain blocks may be specified to be “variable.” Forexample, constant number blocks, constant Boolean blocks, and instrumentblocks may be specified to be variable.

The variable area 313 provides for modifying variable blocks. Thevariable area 313 displays each variable block name and its defaultvalue. The variable area may be selected to change a variable block nameand/or its default value. Variables may also be referred to asparameters of the algorithm.

As illustrated, the design canvas area 311 includes two blocks that havebeen specified as variable, instrument block 321 and constant block 322.A block may be specified as variable when it is being placed or after itis placed, for example. For example, a cursor may be used to select theblock and then a menu option may be selected to specify the block shouldbe made variable. A block specified variable may be indicated with adifferent color, border, background, pattern, and/or text, for example.Here, the text “[Variable]” has been appended to the displayed blockname.

As discussed above, the variable area 313 includes a name column 323with entries for each variable block 321 and 32 and a default valuecolumn 324 with corresponding default value entries for each variableblock. For example, instrument block 321 is named “InstrumentBlock0” andhas a default value of “ESZ0” and constant block 322 is named“ConstantBlock0” and has a default value of “5.”

A user can select a default value entry in column 324 to change thedefault value of the variable block, so that the new default value isused in the evaluation of the algorithm. Similarly, the user can selecta name entry in the name column 323 to change the name of the respectivevariable block. The variable blocks 321 and 322 may allow a user tomanipulate the behavior of the algorithm, rather than the underlyinglogic, by changing the value of the variable bock, which acts as aparameter to the algorithm, for example.

The control area 314 provides controls for use in designing thealgorithm. The control area 314 may include a play button and a pausebutton for initiating and pausing simulation of the algorithm. Thesimulation of the algorithm may be used to indicate how the logic of thealgorithm will behave. In addition, the control area 314 may include agenerate button (not shown) which will cause programming code to begenerated based on the algorithm. The generate button may be used whenprogramming code is not being generated automatically based on changesto the algorithm. This may be desirable when the algorithm beingdesigned is complex and generation of programming code (and thesubsequent compilation of that programming code if appropriate) aftereach modification to the algorithm takes an undesirably long time. Incertain embodiments, the control area 314 may include a compile button(not shown) which will cause programming code generated based on thealgorithm to be compiled. The compile button may be used whenprogramming code is not being generated and/or compiled automaticallybased on changes to the algorithm. This may be desirable when thealgorithm being designed is complex and compilation of programming codeafter each modification to the algorithm takes an undesirably long time.

FIGS. 3F-3G illustrate a trading interface 310 according to certainembodiments. The trading interface 310 provides a live feedback feature.The live feedback feature provides, for a particular block in the designcanvas area 311, a display of a value for the particular block. Forexample, a live feedback value may be displayed for one or more inputsand/or outputs of that block. The live feedback value may be displayedin relation to the block or the corresponding input and/or output, forexample. The live feedback may be updated whenever the value of an inputor output for a block changes. Note that the change in an output for oneblock may result in a change in the output of another block which takesthe first block's output as an input (either directly or indirectly),resulting in live feedback for both blocks being updated.

As illustrated in FIG. 3F, various blocks 331 have been placed in thedesign canvas area 311. For each output of the blocks 331, live feedback332 is provided showing the value of the output. Note that blocks 333are number blocks and live feedback is not provided because the value ofthe output is shown in the display of the blocks 333 themselves. Incertain embodiments, live feedback is provided for one or more inputs ofa particular placed block. In certain embodiments, live feedback isprovided for both inputs and outputs of a particular placed block. Incertain embodiments, live feedback is provided for all blocks in thedesign canvas area 311.

The live feedback for the instrument block displays a value of “GCJ1.”The live feedback for the instrument attribute block, which isconfigured to provide the bid quantity, displays a value of “3,”representing that the bid quantity for the instrument GCJ1 is 3. Thelive feedback for the adder block displays a value of 13, which is thesum of the two input values 3 (from the instrument attribute block) and10 (from the first number block). The live feedback for the divide blockdisplays a value of 6.5, which is the result of dividing the first inputvalue 13 (from the adder block) by the second input value of 2 (from thesecond number block).

The live feedback may not be provided for certain blocks unless thealgorithm is being simulated. For example, as illustrated in FIG. 3G,live feedback is not provided for the outputs of the market maker block335. This is because, unless the algorithm is running (for example,being simulated), the market maker block 335 does not operate andinteract with a market. Thus, the market maker block 335 does notprovide any continuous values based on its operation (because it is notoperating) nor does it generate any discrete events (again, because itis not operating). Live feedback is also not provided for the outputs ofthe value extractor block 336. This is because the value extractor block336 has a discrete input and thus its outputs only have values when adiscrete event is received. However, unless the algorithm is running,discrete events are not received.

The live feedback values to be displayed are provided from the algorithmitself. For example, generated programming code for the algorithm beingdesigned may include additional instructions to update the display of atrading interface such as trading interface 310. In certain embodiments,the generated programming code for the algorithm does not includeadditional instruments for updating the display of a trading interfacebecause, for example, no trading interface may be present, such as on analgorithm server 302. As illustrated in FIGS. 3D-2 and 3D-3, the“SetAllVariables” method, when invoked, invokes a “SendUpdate” method.The SendUpdate method provides to the user interface an identificationof the block the update is for, the particular output index the updateis for, and the value (here, the value of the adder block). Thus,whenever the value for a block changes, the update is provided to theuser interface to update the live feedback. The SendUpdate method mayalso be invoked by base classes of blocks which generate to derivedclasses to provide the user interface updated values. Similarly, asillustrated in FIG. 3D-6, the “InterceptOrderMessage” event handler wasregistered to be invoked when the event “DiscreteObjectGenerated”occurs. The InterceptOrderMessage method provides to the user interfacenotification the corresponding discrete event. Thus, whenever thisdiscrete event is generated, the user interface can provide livefeedback.

When an algorithm is running (such as when it is being simulated), livefeedback may be provided for all of the blocks in the design canvas area311. Because discrete events occur at particular points in time, anindicator of the occurrence of a discrete event may be displayed whenthe event occurs. For example, a discrete input and/or output may flash,change color, size, or shape, when a discrete event occurs at thatinput/or output. As another example, a connection between a discreteinput and output may flash, change color, size, or shape, when adiscrete event is provided through the connection. As another example,an animation along the connection may be provided to represent adiscrete event being provided from the output to the input along theconnection. The animation may be, for example, an icon, such as a redcircle, moving along the connection or the connection may pulsate.

The live feedback feature provides feedback to a user when an algorithmis being designed and when an algorithm is being run. The live feedbackmay allow the user to evaluate how the logic of the algorithm behaves,including the algorithm's operational safety and completeness, generaltendencies, and profit/loss possibilities.

FIGS. 3H-3L illustrate a trading interface 310 according to certainembodiments. The trading interface 310 provides safety features toreduce potential errors when an algorithm is designed.

As illustrated in FIG. 3H, instrument block 341 has been placed in thedesign canvas area 311. However, when the instrument block 341 wasplaced, no instrument was specified, which is an invalid configurationbecause the instrument block cannot output the instrument name if theinstrument has not been specified. A warning indicator 342 (here, anicon with an exclamation point (“!”) in a red circle) is displayed nearthe instrument block 341 to indicate there is a problem and anexplanation 343 of the problem is displayed when a cursor is placed nearthe instrument block 341. In certain embodiments, other (or additional)indicators may be displayed to indicate a problem such as the backgroundof the design canvas area 311 being tinted red and/or a warning or errormessage being displayed in a status bar, for example.

As illustrated in FIG. 3I, instrument attribute block 344 has beenplaced in the design canvas area 311. However, the instrument attributeblock 344, configured to provide the best bid price for an instrument,has not been provided with a required input: the instrument name toprovide the best bid price for. That is, the instrument attribute block344 has not been connected to an instrument block (or other block thatmay provide an instrument name). Consequently, the algorithm definitionis invalid. A warning indicator and an explanation are also displayed,similar to those in FIG. 3H.

As illustrated in FIG. 3J, an instrument attribute block 344 and amarket maker block 345 have been placed in the design canvas area 311. Auser is attempting to connect the output of the instrument attributeblock 344 (a continuous output with a numeric value type) to theinstrument input of the market maker block 345 (a continuous input withan instrument value type). The value types for these inputs and outputsare incompatible and therefore would result in an invalid algorithmdefinition. An indicator 346 (here, a circle with a slash through it) isdisplayed on the attempted connection line to indicate the connection isnot valid. In addition, an explanation 347 is also displayed. Similarfeedback may also be provided if a connection is attempted between acontinuous output and a discrete input.

As illustrated in FIG. 3K, adder block 348 a and adder block 348 b havebeen placed in the design canvas area 311. A user is attempting toconnect the output of adder block 348 b to the input of adder block 348a. However, the output of adder block 348 a is already connected as aninput to the adder block 348 b. Allowing the attempted connection wouldresult in a cyclic dependency in the generated programming code.Specifically, in attempting to generate programming code to determinethe value for the adder block 348 a would result in an infinite loop.Thus, such an algorithm definition is invalid and, similar to thefeedback provided in FIG. 3J, the connection is indicated to be invalidand an explanation is displayed.

As illustrated in FIG. 3L, generator block 349 a, funnel block 349 b,value extractor block 349 c, and value accumulator block 349 d have beenplaced in the design canvas area 311. A user is attempting to connectthe discrete output of value accumulator block 349 d to a discrete inputof funnel block 349 b. However, each of funnel block 349 b, valueextractor block 349 c, and value accumulator block 349 d arepass-through blocks, so each discrete event received is passed outthrough a corresponding discrete output the output. Thus, when adiscrete event is provided by the generator block 349 a (also connectedto the funnel block 349 b), it will be passed through each connectedblock. Allowing the attempted connection would result in an infiniteloop in the generated programming code. Specifically, the generatedprogramming code would, in processing the discrete event provided by thegenerator block, infinitely pass the discrete event to each block inturn to be processed, where that processing includes providing thediscrete event to the next block in the cycle. Thus, such an algorithmdefinition is invalid and, similar to the feedback provided in FIG. 3J,the connection is indicated to be invalid and an explanation isdisplayed.

In certain embodiments, warnings and/or error messages may be providedin a separate area of the trading interface 310. This may allow a userto readily view all outstanding warnings and errors rather thanindividually examining each block, for example.

FIGS. 3M-3R illustrate a trading interface 310 according to certainembodiments. The trading interface 310 provides grouping features toallow, for example, reducing clutter, enabling re-use of portions ofalgorithms (including creating modules that may be shared betweenalgorithms), and to enable the virtualizing feature. Reduced clutter andre-use of portions of algorithms may lead to better algorithms becauseit reduces the likelihood of mistakes in the algorithm design.Advantages of the virtualizing feature are discussed below.

As illustrated in FIG. 3M, a definition for a simple scalping algorithmhas been designed. As an overview, the scalping algorithm will buy atthe best bid price and then sell at one trading increment above the fillprice, making a profit of one trading increment per unit bought andsold. More particularly, the algorithm includes a buy market maker block351 and a sell market maker block 352. The buy market maker block 351 isprovided with an instrument to buy (“ESZ0”) specified by an instrumentblock. The buy market maker block 351 is provided with a price to buy atspecified by an instrument field block which provides the best bid pricefor the instrument. The buy market maker block 351 is provided with afixed quantity of 10 to buy specified by a number block. When the buymarket maker block 351 receives fill confirmations for the buy order itis working, a discrete event is generated.

The sell market maker block 352 will work the sell orders to cover theposition taken by the buy market maker block 351. The sell market makerblock 352 is provided with the same instrument (“ESZ0”) to sell. Thesell market maker block 352 is provided with a price to sell atspecified by an adder block which adds the minimum price increment forthe instrument (provided by an instrument field block) to the fill price(provided by a value extractor block from the discrete event generatedby the buy market maker block 351 when a fill confirmation is received).The sell market maker block 352 is provided with a quantity to sellspecified by an accumulator block which provides the accumulatedquantity that has been bought by the buy market maker block 351, whichis extracted from the discrete events generated when fill confirmationsare received by the buy market maker block 351.

Thus, when the algorithm is run, the buy market maker block 351 will buya quantity of 10 at the best bid price and sell (perhaps across multiplesell orders) a quantity of 10 at the fill price plus the minimum priceincrement.

As illustrated in FIG. 3N, the blocks associated with the covering logicportion of the algorithm have been selected by drawing a box 353 aroundthem. Other user interface techniques may also be used to select theblocks of interest to the user such as selecting with a cursor incombination with the shift or control key being pressed, for example.

Once the blocks have been selected, they may be grouped by an actionsuch as selecting a menu item.

As illustrated in FIG. 3O, the grouped blocks are then displayed in agroup block 353 with a thumbnail image of the blocks contained therein.The group block 353 reduces the clutter of the design canvas area 311 byreducing the number of blocks and connections shown. In addition, agroup block may be saved in a library of modules so that it may beloaded in another algorithm and re-used. A group block may also bereferred to as a grouped block. The blocks within the group block may bereferred to as a portion of the defined algorithm, a sub-algorithm, or asubroutine, for example.

The group block 353 may be created with inputs 354 corresponding to theinputs of blocks in the group block 353 that are provided values byoutputs of blocks not in the group block 353. For example, asillustrated in FIG. 3O, the group block 353 has a continuous instrumentinput and a discrete input. The continuous instrument input correspondsto the continuous instrument inputs of the sell market maker block 352and the instrument field block which determines the minimum priceincrement. The discrete input corresponds to the discrete input of theaccumulator block and the value extract block.

The group block 353 may be selected and then using an action, such asselecting a menu item or a double-click, the blocks included in thegroup block 353 may be edited. As illustrated in FIG. 3P, a new windowwith a design canvas area similar to the design canvas area 311 may bedisplayed and manipulated in the same manner. The group block 353includes two new input blocks 355 and 356, which correspond to theinputs of the group block 353. Input block 355 corresponds to thecontinuous instrument input of the group block 353 and input block 356corresponds to the discrete input of the group block 353. Each inputblock 355 and 356 has a single output providing the value that isprovided to the respective input of the group block 353.

Although not shown in FIG. 3P because none of the blocks in the groupblock 353 have an output connected to a block outside of the group block353, a group block may also include output blocks. Similar to the inputblocks discussed above, output blocks correspond to outputs of the groupblock. Blocks within the group block that have outputs connected to anoutput block will provide values to blocks outside of the group blockthat are connected to the corresponding output of the group block.

When designing a group block, input blocks and output blocks may beplaced to create an input or output for the group block. When placed,the user may be prompted to specify the type of the input or output.Alternatively, the input or output block may default to a predefinedtype such as continuous numeric. The type of the input or output blockmay be changed by the user during the design of the algorithm by, forexample, selecting the input or output block and using an action such asa menu item or double-click to be prompted to enter a type. Similarly,the user may also specify a name for the input or output block (and thusthe corresponding input or output of the group block).

A group block may contain another group block. This nesting of groupblocks allows for less clutter and potentially greater reusability ofvarious portions of algorithms.

When generating program code, a group block is generated as a subclassof the Algorithm class which is nested within the main CustomAlgorithm0class for the algorithm being designed. When group blocks are nestedwithin other group blocks, the generated programming code similarlynests each generated subclass. Additionally, any non-primitive blocksare declared and defined in their nearest group-block parent. So, forexample, if a group block is nested three group blocks deep and it has amarket maker block (an example of a non-primitive block) within it, thesubclass of the market maker block will reside in the three-deep derivedalgorithm class.

Returning to the scalping algorithm discussed above, as illustrated inFIG. 3M, this algorithm has a flaw. Recall that the scalping algorithmaims to buy a the best bid price and then sell at one trading incrementabove the fill price, making a profit of one trading increment per unitbought and sold. If the buy market maker block 351 receives a singlefill for the entire quantity of 10 for the buy order it places, then thealgorithm will operate as intended. However, if more than one fillconfirmation is received at more than one price level, then thealgorithm will not function as desired. For example, assume that the buymarket maker block 351 works an order to buy a quantity of 10 at thebest bid price of 114125. Then, a first fill confirmation is receivedfor a quantity of 3 (thus, the first fill was for a quantity of 3 at afill price of 114125). In response to this fill, the sell market makerblock 352 will work an order to sell a quantity of 3 at a price of114150 (114125 (fill price)+25 (minimum price increment)). Now assumethat the best bid price decreases to 114100. The buy market maker block351 will then re-quote its working order to the new (and now lower) bestbid price for a quantity of 7. Then, a second fill confirmation isreceived for a quantity of 7 (thus, the second fill was for a quantityof 7 at a fill price of 114100). Therefore, the desired behavior of thescalping algorithm is that a first sell order for a quantity of 3 (tocover the first fill) should be placed at a price of 11450 (114125+25)and a second sell order for a quantity of 7 (to cover the second fill)should be placed at a price of 114125 (114100+25).

However, the algorithm illustrated in FIG. 3M will not properly workorders to achieve the desired behavior. When the first fill is received,the sell market maker block 352 will place a first cover order to sell aquantity of 3 at a price of 114125+25. However, if the second fill isreceived before the first cover order is filled, the sell market makerblock 352, receiving a new quantity to quote from the accumulator block(which is updated to reflect that a quantity of 10 has now been filled),will work its cover order for a quantity of 10 at a price of 114100+25(the price of the most recent fill (the second fill) plus the minimumprice increment). Consequently, the first fill will not get covered atthe desired price (which is unintended and/or undesirable behavior).Here, if the cover order is filled completely, the entire quantity of 10for the cover order will be filled at the same price, even though thedesired behavior of the algorithm would be for the cover orders to beworked at a price and quantity particular to each fill received.

The virtualizing feature of the trading application 300 addressesproblems of this nature. A group block may be selected and then using anaction, such as selecting a menu item, the group block may be specifiedto be virtualized. As illustrated in FIG. 3Q, group block 353 has beenvirtualized and this is indicated by changing the border of the groupblock 353 from a solid line to a dashed line. In certain embodiments, agroup block may be designated as virtualized in other ways, such asappending text to the name of the block, changing the border color,background color, or background pattern, for example.

An instance of a virtualized group block is created for each discreteevent that is provided to the virtualized group block. That is, eachtime a discrete event is received at a virtualized group block, a newinstance of the virtualized group block is created to handle thediscrete event. This addresses the desired behavior discussed above:that each discrete event be handled by the logic of the group bock basedon the information particular to that discrete event. Continuing theexample above, but specifying the group block 353 to be virtualized,each discrete event generated by the buy market maker block 351 for afill will result in a new instance of the virtualized group block 353being created to handle that particular discrete event.

Therefore, every group block to be virtualized must have a discreteevent input because it is the notification of the discrete event to thevirtualized group block which causes a new instance to be created. Oncea virtualized group block has been instantiated, that particularinstance no longer receives discrete events from outside of its scope(that is, from blocks not within the virtualized group block). Rather,any subsequent discrete events from outside of the virtualized groupblock's scope would result in the creation of a new instance of thevirtualized group block. However, discrete events may still be generatedand processed by blocks within the virtualized group block and adiscrete event generated inside the virtualized group block may beprovided to a discrete input of the virtualized group block. FIG. 3Rillustrates conceptually how the logic of the algorithm would work whenthree discrete events have been generated by the buy market maker block351. Three instances of the group block 353 were instantiated inresponse to each of the three discrete events from the buy market makerblock 351. Note that the displayed algorithm would actually only showthe single virtualized group block 353 as illustrated in FIG. 3Q andthat the three instances shown in FIG. 3R are shown only to indicate theconcept of virtualizing a group block. In certain embodiments, thenumber of instances of a group block may be indicated. For example, thenumber of instances may be indicated graphically in a similar manner tothat shown in FIG. 3R by showing a stack of the virtualized group block,where the size of the stack represents the number of instances of thevirtualized group block that have been instantiated. As another example,the number of instances may be indicated by a number displayed in thegroup block (such as in a corner) that represents as count of the numberof instances of the virtualized group block that have been instantiated.

In addition, a virtualized group block cannot have a continuous output(however, it can have discrete outputs) because the value of such anoutput would be semantically undefined. This is because there may bemore than one instance of the virtualized group block (or, potentiallyno instances if a discrete event has not yet been received for it) andthus such a continuous output could have may have different valuessimultaneously (or no value at all). Additionally, a virtualized groupblock may not contain a block specified to be variable because thevariable would not “exist” until the virtualized group block wasinstantiated.

A virtualized group block may contain another group block or anothervirtualized group block, just as group blocks may be nested as discussedabove.

When generating program code, a virtualized group block is generated asa subclass of the Algorithm class, like a non-virtualized group block asdiscussed above. However, rather than being instantiated when the mainCustomAlgorithm0 class, an initially-empty list of subclasses for thevirtualized group bock is maintained and when a discrete event is to beprovided to the subclass corresponding to the virtualized group block, anew instance of the virtualized group block subclass is created.

The network connection between a client device and an algorithm servermay be severed unexpectedly. For example, the Internet service provider(“ISP”) used by the client device to connect to the algorithm server mayhave a router failure or physically severed communications link whichmay break communication between the client device and the algorithmserver. As another example, an intermediate node in the network mayfail, also breaking communication between the client device and thealgorithm server. As another example, the client device may crash,breaking the connection to the algorithm server. In current systems,when such a connection is broken, the algorithm is either halted orcontinues to run without knowledge that the connection has been broken.In the former case, a trader may be left with open positions that hecannot get out of easily (or potentially at all, since his connection isdown). In the latter case, a trader may be unable to modify parametersfor, shut down, or stop an algorithm that is not longer operatingcorrectly or which may inappropriate for changes in conditions in themarket. Often traders run algorithms that may be very risky, and theymay desire to be able to turn them off or change the parameters at amoment's notice.

In certain embodiments, one or more blocks can be specified to be awareof the connection state between a client device and an algorithm server.For example, when placed, the user may be presented with an option tospecify that the block should continue to run even if the connectionbetween the client device and the algorithm server running the algorithmis disconnected. The option may also be specified by selecting the blockand using an action such as a menu item or keyboard command. By default,an algorithm may pause or halt when the connection between the clientdevice and the algorithm server is broken. In certain embodiments, theentire algorithm is specified to continue to run even if the connectionbetween the client device and the algorithm server running the algorithmis disconnected.

For example, a market maker block may have an option to keeps ordersgenerated by the market maker block in the market even if the connectionbetween the client device and the algorithm server is broken. A marketmaker block being used in a hedging or cover order portion of thealgorithm may be configured in this manner so that any position taken byanother part of the algorithm is will be hedged or covered as desired,even if the portion of the algorithm placing those orders is no longerrunning because the connection is broken.

In certain embodiments, an input block may be added to the algorithmbeing designed which provides a continuous Boolean output representingthe state of the connection between the client device and the algorithmserver. Blocks may then take the value from this connection state inputblock as an input to control their behavior. For example, the connectionstate input block may be connected to the conditional input of a marketmaker block so that the market maker block only works an order when theconnection state is TRUE (representing connected).

Once an algorithm has been defined in the trading interface 310, it maybe saved. An algorithm may also be given a name (for example, while thealgorithm is being built and/or when the algorithm is saved). The savedalgorithm may then be recalled or referenced at future time with thetrading interface 310 or with another trading interface. For example,the saved algorithm may be loaded with the trading interface 310 so thatit may be edited or re-used on another order. As another example, thesaved algorithm may be referenced as an order type from another tradinginterface as discussed below.

The components, elements, and/or functionality of the trading interface310 discussed above may be implemented alone or in combination invarious forms in hardware, firmware, and/or as a set of instructions insoftware, for example. Certain embodiments may be provided as a set ofinstructions residing on a computer-readable medium, such as a memory,hard disk, CD-ROM, DVD, EPROM, and/or file server, for execution on ageneral purpose computer or other processing device.

IV. Launching and Managing Algorithms

Certain embodiments provide for initiating placement of an order to bemanaged by an algorithm selected as an order type. Certain embodimentsprovide for initiating placement of an order to be managed by a selecteduser-defined trading algorithm from a value axis. Certain embodimentsprovide for changing a variable for an algorithm while the algorithm ismanaging an order. Certain embodiments provide for manually modifying anorder being managed by an algorithm. Certain embodiments provide forassigning to an unmanaged order an algorithm to manage the order.Certain embodiments provide for displaying working orders being managedby different user-defined trading algorithms on a value axis.

FIGS. 4A-4F illustrate trading interfaces according to certainembodiments. As illustrated in FIG. 4A, trading interface 410 is anorder ticket that allows a saved algorithm to be selected as an ordertype. The saved algorithms may have been saved using a trading interfacesimilar to trading interfaces 200 and 310 discussed above, for example.

The saved algorithm may be selected using the selection interface 415,which, as illustrated, provides a drop-down list that includes bothstandard order types (such as limit and market) as well as savedalgorithms. In certain embodiments, the selection interface 415 includesother elements for selecting from available saved algorithms. Forexample, the selection interface 415 may open a file navigator to browsefor a particular algorithm. As another example, the selection interface415 may include a tree view of saved algorithms which have beencategorized in a hierarchy based on algorithm type.

Trading interface 420 is a simplified order ticket that also allows asaved algorithm to be selected as an order type with a selectioninterface 415.

When an order is initiated from trading interface 410 or 420 and a savedalgorithm has been selected as the order type, the order is managedaccording to the selected algorithm. If the selected algorithm has beenconfigured to take parameters from the trading interface (such as anorder ticket price or quantity), the values specified in the tradinginterface 410 or 420 will be provided to the algorithm when it is run.

As illustrated in FIGS. 4B-4C, trading interface 430 (an order ticketstyle trading interface similar to trading interface 410 discussedabove) and trading interface 440 (a market depth ladder or axis styletrading interface) are shown after an algorithm order type has beenselected using a selection interface 415. Here, the selected algorithmis similar to the one illustrated in FIG. 2I. The trading interface 440may include a value axis which includes values corresponding to or basedon price levels for a tradeable object. The values may be prices for thetradeable object (such as in a price axis), for example. Informationrelated to the tradeable object, such as quantity available at the pricelevels corresponding to the values in the value axis, may also bedisplayed along the value axis. The variables of the algorithm are shownin variable areas 435 and 445, respectively, and may be changed beforeinitiating an order. Variable area 435 is incorporated into tradinginterface 430 as part of the same window. Variable area 445 isincorporated into trading interface 440 as a separate window. Thevariables in variable area 435 and 445 default to the values specifiedin the default value column 272 of the variable area 206, as illustratedin FIG. 2I. When changed, an initiated order will be worked according tothe selected algorithm with the changed variable values.

As illustrated in FIG. 4D, trading interface 450 is an order bookshowing orders working in the market. Here, an order 451 being workedaccording to an algorithm (also similar to the one illustrated in FIG.2I) is selected. The variables of the algorithm are shown in variablearea 455 (similar to variable areas 435 and 445) and may be changed.When changed (and the change is applied), the algorithm will continue torun according to the changed variable values. The change to thevariables becomes effective without pausing or stopping the algorithm.

In certain embodiments, the trading interface 450 allows a user tomanually modify an order being managed by an algorithm. For example, auser may change the price or quantity of the order or delete the order.In response, the algorithm managing the order may change the orderprice, it may change the order quantity, it may do nothing, or it mayperform no new action but merely have new information or thresholdsbased on the manual modification to use according to the algorithmdefinition, for example.

In certain embodiments, the trading interface 450 may include an orderthat is not being managed by an algorithm (for example, a manuallyentered order). This unmanaged order may be selected and an algorithmmay be applied to it. For example, a user may select the unmanaged orderand, using an action such as a menu item or keyboard command, bepresented with a list of available algorithms to apply to the selectedunmanaged order. The list of available algorithms may include savedalgorithms which include an order block, for example. When applied tothe selected unmanaged order, the selected algorithm may then manage theorder according to the algorithm. As another example, a user may selectan unmanaged good-til-cancelled (“GTC”) order and apply a selectedalgorithm to it so that the algorithm may manage the order across futuretrading sessions.

As illustrated in FIG. 4E, trading interface 460 is a market depthladder or axis style trading interface similar to trading interface 440discussed above. Several orders have been initiated and are illustratedworking at different price levels. Orders 461 were initiated to bemanaged with a first algorithm and orders 462 were initiated to bemanaged with a second algorithm. Thus, the trading interface 460provides for a single interface displaying multiple working orders beingmanaged according to the same algorithm. Additionally, the tradinginterface 460 provides for a single interface displaying working ordersbeing managed according to multiple algorithms.

In certain embodiments, working orders being managed according to aparticular algorithm are commonly identified. For example, each workingorder associated with a first algorithm may be identified graphically,for example, with a particular background color, foreground color,background pattern, border color, border style, shape, symbol, number,text, and/or font. Working orders associated with a second algorithm maythen be identified using a different color, pattern, border, shape,symbol, number, text, and/or font, for example.

In certain embodiments, working orders being managed according to aparticular algorithm are individually identified. For example, eachworking order associated with a different instance of the same algorithmmay be distinguished from other working orders associated with differentinstances of that algorithm with an identifier such as a color, pattern,border, shape, symbol, number, text, and/or font. Orders being managedaccording to a first instance of an algorithm may have a number “1” inthe corner of their working order indicators whereas order being managedaccording to a second instance of the algorithm may have a number “2” inthe corner of their working order indicators. The indication of workingorders being managed by different instances of a particular algorithmmay be applied in combination with the indication of working ordersbeing managed by different algorithms discussed above.

As illustrated in FIG. 4F, trading interface 470 is an algorithmmanager. The trading interface 470 may also be referred to as a cockpitor dashboard. The trading interface 470 includes a list 471 of availablealgorithms. A particular algorithm may be selected from the list 471.When an algorithm is selected, a view of a selected algorithm isdisplayed in the view area 472 and a list 473 of running instances ofthe selected algorithm is also displayed. As illustrated, the view area472 may show an algorithm definition made using a trading interfacesimilar to trading interface 310 discussed above. However, the view area472 may also display a view of an algorithm defined using a tradinginterface similar to trading interface 200 discussed above. The list 473of running instances of the selected algorithm may include informationabout the running instance such as the time it was initiated, itsposition, status, profit and loss, number of working orders, number offilled orders, instrument the most recent order was placed for and/or afill was received for, and/or order account information, for example.

In addition, variable area 474 displays the variables of the selectedalgorithm and the values of those variables for a selected instance ofthe selected algorithm. The variable area 474 is similar to the variableareas 435, 445, and 455 discussed above. The variables for the selectedinstance of the selected algorithm may be changed. When changed (and thechange is applied), the algorithm will continue to run according to thechanged variable values. The change to the variables becomes effectivewithout pausing or stopping the algorithm.

In certain embodiments, a trading interface, such as trading interfaces200, 290, 310, 410, 420, 430, 440, 450, 460, and/or 470, is adapted toallow a user to specify the behavior when an order being managed by analgorithm is unfilled at the close of a trading session. For example, atrading interface may allow the user to specify that an unfilled orderbeing managed by an algorithm should be cancelled and the algorithmstopped. As another example, a trading interface may allow the user tospecify that an unfilled order being managed by an algorithm shouldcontinue to be managed at the start of the next trading session. Asanother example, a trading interface may allow the user to specify thatan unfilled order being managed by an algorithm should be paused at thestart of the next trading session and to resume being managed by thealgorithm when un-paused by the user.

The components, elements, and/or functionality of the trading interfaces410, 420, 430, 440, 450, 460, and 470 discussed above may be implementedalone or in combination in various forms in hardware, firmware, and/oras a set of instructions in software, for example. Certain embodimentsmay be provided as a set of instructions residing on a computer-readablemedium, such as a memory, hard disk, CD-ROM, DVD, EPROM, and/or fileserver, for execution on a general purpose computer or other processingdevice.

V. Ranking Tool

FIG. 5 illustrates a ranking tool 500 according to certain embodiments.The ranking tool 500 may be used for ranking hedge options, for example.In futures trading, one of the most common strategies is to “spreadtrade,” which is a method by which a trader with market directional riskexposure in one instrument is willing to hedge his risk by placing atrade in one or more like instruments to offset, minimize, or decreasethe variance of the trader's risk. The two prices at which the twopositions are initiated create a combination or spread price. The tradermay then eventually attempt to perform trades that unwind the openposition, preferably at a spread price differential that yields a profitfrom the prices at which he initiated the position.

For some automated trading programs a hedge technique can be implementedthat automatically hedges the risk for the trader. This hedge techniquemight be automated to hedge in one particular instrument, or may beprogrammed to choose between a plurality of instrument choices accordingto a pre-programmed method. However, current systems do not provide forhedging trades that are not tied to pre-determined instrument choices.

The difficulty in initiating a non-automated spread trade position,particularly for a market maker, is that, due to the speed gains intechnology, opportunities to hedge one's trades most efficiently havebecome very difficult. Due to the nature of their liquidity providingrole in the markets, a market maker is frequently notified with nonotice or preparation that they are providing liquidity (i.e. arereceiving a trade execution) for a counter-party. For the market makeror any trader who may suddenly acquire an open trading position, thetime gap between when a first leg of a spread is initiated and when atrader can hedge this trade has become a serious detriment to efficienthedging and risk management. A trader who is unable to quickly hedge atrade may lose hundreds, thousands, or even millions of dollars. Thetrader must not only expend the time to decide what instrument is theirbest instrument with which to hedge but they must also execute the hedgetrade.

Certain embodiments provide a ranking tool 500 that provides twodistinct speed advantages in manually hedging a trade to optimallycreate (but not limited to creating) a spread position. The first aspectlets a user pre-select a group of instruments which are constantlyanalyzed by a pre-programmed method of parameters to determine, inpreferential order, which contract(s) is the most advantageousinstrument to buy or sell at any particular moment. In one embodiment,this technique can be implemented to analyze various bid/ask levels inexisting spread markets in an instrument that the program isconsidering. In another embodiment, it may look at the trader's tradingposition inventory to decide which hedge trade will assist the trader inbest lowering his overall risk. In reality, the methods behind thesystem's execution process are limitless. This information can be usedby the trader to eliminate the time required to decide what instrumentwith which to hedge their risk.

Another aspect of the ranking tool 500, in addition to the ability toautomatically analyze what instrument provides the optimal hedge, isthat it can be used to actually automatically enter a buy or sell orderor group of orders to execute the “best” hedge or group of hedgesavailable in the market according to the aforementioned pre-programmedhedging method. A trader's only potential actions required are topre-select the instruments under consideration, enter the desiredquantity (which can be pre-set), and to click a buy or sell executionheading on the trading interface. This automated hedger leaves thetrader with various hedged trade inventory that should be accumulated atadvantageous spread prices that align with the trader's desired rankingmethod. The ranking tool 500 is useful for any trader who runs the riskof executing a trade that could become difficult to hedge under a largevariety of market circumstances.

The ranking tool 500 includes a selection area 510 with a listing oftradeable objects that a user can identify or select for analysis. Inthis example, the listed tradeable objects are Eurodollar futures forvarious months. The “Best” columns (best buys 520 and best sells 530)display a ranking of the selected instruments in order, with buys 520 inthis example being ranked based on the current ask price and sells beingranked based on the current bid price.

The Order Ticket portion 540 of the ranking tool 500 allows the user toenter a quantity to buy or sell according to the rank system. The Buyand Sell buttons allow auto execution of a desired instrument. In thissystem, a user has various choices 550, including the choice to onlybuy/sell the number one ranked instrument, to fill all selectedinstruments, or to loop if necessary. For example, in the event that atrader's desired quantity is not satisfied by the quantity availablewith the instrument at the number one position, the ranking tool 500 canwork a limit order in that instrument at the initial price. A moreaggressive approach is to execute whatever quantity is available for theinstrument at the number one position, and if necessary move on toauto-hedge to the next contracts. The auto-execute will only workthrough to the bottom of the list (the number 5 rank in this example),and work a limit order if the quantity associated with it still has notbeen satisfied by trading through higher all the listed months. Theranking tool 500 can loop if necessary, such as where a pure marketorder exists and the application will continue on to the next availableprice while re-starting at the top of the list.

The components, elements, and/or functionality of the ranking tool 500discussed above may be implemented alone or in combination in variousforms in hardware, firmware, and/or as a set of instructions insoftware, for example. Certain embodiments may be provided as a set ofinstructions residing on a computer-readable medium, such as a memory,hard disk, CD-ROM, DVD, EPROM, and/or file server, for execution on ageneral purpose computer or other processing device.

VI. Example Computing Device

FIG. 6 illustrates a block diagram of a computing device 600 accordingto certain embodiments. The client device 110 may include one or morecomputing devices 600, for example. The client device 301 may includeone or more computing devices 600, for example. The algorithm server 302may include one or more computing devices 600, for example. The gateway120 may include one or more computing devices 600, for example. Theexchange 130 may include one or more computing devices 600, for example.The exchange 303 may include one or more computing devices 600, forexample.

The computing device 600 includes a bus 610, a processor 620, a memory630, a network interface 640, a display device 650, an input device 660,and an output device 670. The computing device 600 may includeadditional, different, or fewer components. For example, multiple buses,multiple processors, multiple memory devices, multiple networkinterfaces, multiple display devices, multiple input devices, multipleoutput devices, or any combination thereof, may be provided. As anotherexample, the computing device 600 may not include an output device 670separate from the display device 650. As another example, the computingdevice 600 may not include a display device 650. As another example, thecomputing device 600 may not include an input device 660. Instead, forexample, the computing device 600 may be controlled by an external orremote input device via the network interface 640.

The bus 610 may include a communication bus, channel, network, circuit,switch, fabric, or other mechanism for communicating data betweencomponents in the computing device 600. The bus 610 may becommunicatively coupled with and transfer data between any of thecomponents of the computing device 600. For example, during aninstallation process of a trading application, one or morecomputer-readable instructions that are to be executed by the processor620 may be transferred from an input device 660 and/or the networkinterface 640 to the memory 630. When the computing device 600 isrunning or preparing to run the trading application stored in the memory630, the processor 620 may retrieve the instructions from the memory 630via the bus 610.

The processor 620 may include a general processor, digital signalprocessor, application specific integrated circuit, field programmablegate array, analog circuit, digital circuit, programmed processor,combinations thereof, or other now known or later developed processingdevice. The processor 620 may be a single device or a combination ofdevices, such as associated with a network or distributed processing.Any processing strategy may be used, such as multi-processing,multi-tasking, parallel processing, and/or remote processing, forexample. Processing may be local or remote and may be moved from oneprocessor to another processor.

The processor 620 may be operable to execute logic encoded in one ormore tangible media, such as memory 630 and/or via network device 640.As used herein, logic encoded in one or more tangible media includesinstructions that are executable by the processor 620 or a differentprocessor. The logic may be stored as part of software, hardware,integrated circuits, firmware, and/or micro-code, for example. The logicmay be received from an external communication device via acommunication network, for example, connected to the Internet. Theprocessor 620 may execute the logic to perform the functions, acts, ortasks illustrated in the figures or described herein.

The memory 630 may be tangible media, such as computer readable storagemedia, for example. Computer readable storage media may include varioustypes of volatile and non-volatile storage media, including but notlimited to random access memory, read-only memory, programmableread-only memory, electrically programmable read-only memory,electrically erasable read-only memory, flash memory, magnetic tape ordisk, optical media, any combination thereof, or any other now known orlater developed tangible data storage device. The memory 630 may includea single device or multiple devices. For example, the memory 630 mayinclude random access memory and hard drive storage. The memory 630 maybe adjacent to, part of, programmed with, networked with, and/or remotefrom processor 620, such that data stored in the memory 630 may beretrieved and processed by the processor 620, for example.

The memory 630 may store instructions that are executable by theprocessor 620. The instructions may be executed to perform one or moreof the acts or functions described herein or shown in the figures.

The network interface 640 may be a one-way or two-way communicationcoupling. Accordingly, the network interface 640 may communicativelyconnect one, two, or more communication networks or devices. Forexample, the bus 610 may be coupled with a gateway similar to gateway120 discussed above via the network interface 640, such that one, some,or all of the components of the computing device 600 are accessible orcan communicate with the gateway. As another example, the networkinterface 640 may couple the bus 610 with other communication networks.The network interface 640 may be, for example, an integrated servicesdigital network (ISDN) card or a modem to provide a data communicationconnection. As another example, network interface 640 may be a localarea network (LAN) card to provide a data communication connection to acompatible LAN, for example, connected to the Internet. Wireless linksmay also be implemented. The network interface 640 may send and receiveelectrical, electromagnetic, or optical signals that carry analog ordigital data streams representing various type of information, forexample.

The display device 650 may include a visual output device, cathode raytube (CRT) display, electronic display, electronic paper, flat paneldisplay, light-emitting diode (LED) displays, electroluminescent display(ELD), plasma display panels (PDP), liquid crystal display (LCD),thin-film transistor displays (TFT), organic light-emitting diodedisplays (OLED), surface-conduction electron-emitter display (SED),laser television, carbon nanotubes, nanocrystal displays, head-mounteddisplay, projector, three-dimensional display, transparent displaydevice, and/or other now known or later developed display, for example.

The display device 650 is adapted to display a trading screen. Thetrading screen may be similar to the trading screens discussed above,for example. The trading screen may be interactive. An interactivetrading screen may allow, for example, one or more trading actions to beperformed using the trading screen. For example, an interactive tradingscreen may allow one or more order entry parameters to be set and/orsent using one or more order entry actions. The display device 650and/or input device 660 may be used to interact with the trading screen,for example.

The input device 660 may include a keyboard, mouse, microphone,touch-screen, trackball, keypad, joystick, and/or other device forproviding input, for example. The input device 660 may be used, forexample, to provide command selections to processor 620. For example,the input device 660 may be a mouse that is used to control a cursordisplayed on a trading screen. The mouse may include one or more buttonsfor selection and control, for example.

The output device 670 may include a keyboard, mouse, speakers,touch-screen, trackball, keypad, haptic device or system, joystick,and/or other device for providing output, for example. For example, theoutput device 670 may be used to output one or more signals, such as ahaptic signal or an audio signal, to a user.

While the present inventions have been described with reference tocertain embodiments, it will be understood by those skilled in the artthat various changes may be made and equivalents may be substitutedwithout departing from the scope of the inventions. In addition, manymodifications may be made to adapt a particular situation or material tothe teachings of the inventions without departing from their scope.Therefore, it is intended that the inventions not be limited to theparticular embodiments disclosed, but that the inventions will includeall embodiments falling within the scope of the claims.

1. (canceled)
 2. A computer readable medium having stored thereininstructions executable by a processor, including instructionsexecutable to: display a design canvas area; receive from a user, in thedesign canvas area, an arrangement of a plurality of placed blocks,wherein the arrangement of the plurality of placed blocks specifies adefinition for a trading algorithm; determine a first live feedbackvalue for a first placed block of the plurality of placed blocks,wherein the first live feedback value is determined based on market dataand the definition for the trading algorithm; display the determinedfirst live feedback value in relation to the first placed block; receivea selection of one or more selected placed blocks of the plurality ofplaced blocks; receive a grouping command; generate a group block basedon the one or more selected placed blocks in response to the groupingcommand; place in the design canvas area the group block, wherein thegroup block includes the one or more selected placed blocks; receive avirtualizing command for the group block; convert the group block into avirtualized group block in response to the virtualizing command, whereinthe virtualized group block is a block that when a discrete event isreceived on an input of the virtualized group block, a new instance ofthe algorithm functionality represented by the one or more selectedplaced blocks in the virtualized group block is instantiated; andinstantiate a new instance of the algorithm functionality represented bythe one or more selected placed blocks in the virtualized group blockwhen the virtualized group block receives a discrete event on an inputof the virtualized group block.
 3. The computer readable medium of claim2, wherein each placed block of the plurality of placed blocks isselected by the user from a plurality of available blocks.
 4. Thecomputer readable medium of claim 2, wherein receiving the arrangementof the plurality of placed blocks from the user includes receivingcommands from the user to create the arrangement of the plurality ofplaced blocks, wherein the first live feedback value is dynamicallydetermined as the commands are received.
 5. The computer readable mediumof claim 2, wherein the first live feedback value is determined for aninput of the first placed block.
 6. The computer readable medium ofclaim 2, wherein the first live feedback value is determined for anoutput of the first placed block.
 7. The computer readable medium ofclaim 2, wherein the market data is received from an electronicexchange.
 8. The computer readable medium of claim 2, wherein the marketdata is received from a simulation environment.
 9. The computer readablemedium of claim 2, wherein first live feedback value is further based ona functionality corresponding to the first placed block.
 10. Thecomputer readable medium of claim 2, further including instructionsexecutable to: detect the generation of a discrete event; and display anindicator representing the occurrence of the discrete event.
 11. Thecomputer readable medium of claim 10, wherein the indicator includesflashing a connection on which the generated discrete event is provided.12. The computer readable medium of claim 10, wherein the indicatorincludes an animation of an output on which the generated discrete eventis provided.
 13. The computer readable medium of claim 10, wherein theindicator includes an animation on a connection on which the generateddiscrete event is provided.
 14. The computer readable medium of claim10, further including instructions executable to: determine a secondlive feedback value for a second placed block of the plurality of placedblocks, wherein the second live feedback value is determined based onmarket data and the definition for the trading algorithm; and displaythe determined second live feedback value.
 15. The computer readablemedium of claim 2, wherein the input of the virtualized group block isconnected to an output of a first block in the plurality of placedblocks that provides fill confirmation discrete events, wherein eachfill confirmation discrete event corresponds to at least a portion of aquantity of an order being filled.
 16. The computer readable medium ofclaim 15, wherein the algorithm functionality represented by the one ormore selected placed blocks in the virtualized group block provideshedging functionality for the at least a portion of the quantity of theorder that was filled corresponding to the received discrete event. 17.The computer readable medium of claim 2, wherein the plurality of placedblocks includes a second placed block, wherein the functionalitycorresponding to the second placed block is based on a connection statebetween a computing device including the processor and an algorithmserver when the trading algorithm is processed by the algorithm server.18. The computer readable medium of claim 17, wherein the connectionstate between the computing device and the algorithm server is providedto the second placed block by a connection to an input of the secondplaced block from a connection state input block.